4 search results - page 1 / 1 » Approximate GCDs of polynomials and sparse SOS relaxations |
TCS
2008
13 years 10 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 ...
ISSAC
2007
Springer
14 years 5 months ago
2007
Springer
JGO
2008
13 years 11 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 ...
SIAMJO
2008
13 years 10 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...