Complexity estimates for the Schmu¨dgen Positivstellensatz
Journal of Complexity
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Complexity estimates for representations of Schmüdgen type
Journal of Complexity
Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares
Journal of Global Optimization
A quantitative Pólya's Theorem with corner zeros
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On the complexity of Putinar's Positivstellensatz
Journal of Complexity
Effective Pólya semi-positivity for non-negative polynomials on the simplex
Journal of Complexity
Describing convex semialgebraic sets by linear matrix inequalities
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On the minimum of a positive polynomial over the standard simplex
Journal of Symbolic Computation
On the generation of positivstellensatz witnesses in degenerate cases
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
SIAM Journal on Optimization
Minimizing ordered weighted averaging of rational functions with applications to continuous location
Computers and Operations Research
A Semidefinite Programming approach for solving Multiobjective Linear Programming
Journal of Global Optimization
Hi-index | 0.00 |
Schmüdgen's Positivstellensatz roughly states that a polynomial f positive on a compact basic closed semialgebraic subset S of Rn can be written as a sum of polynomials which are non-negative on S for certain obvious reasons. However, in general, you have to allow the degree of the summands to exceed largely the degree of f. Phenomena of this type are one of the main problems in the recently popular approximation of non-convex polynomial optimization problems by semidefinite programs. Prestel (Springer Monographs in Mathematics, Springer, Berlin, 2001) proved that there exists a bound on the degree of the summands computable from the following three parameters: The exact description of S, the degree of f and a measure of how close f is to having a zero on S. Roughly speaking, we make explicit the dependence on the second and third parameter. In doing so, the third parameter enters the bound only polynomially.