7 search results - page 1 / 2 » Global minimization of rational functions and the nearest GC... |
JGO
2008
13 years 4 months ago
2008
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
TCS
2008
13 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
DAGSTUHL
2008
13 years 6 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
We have developed an evolutionary approach for the flexible docking that is now an important component of a rational drug design. This automatic docking tool, referred to as the G...