On the complexity of Putinar's Positivstellensatz

Journal of Complexity

Volumn 23, Issue 1, 2007, Pages 135-150

  Nie, Jiawang ^a   Schweighofer, Markus ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Complexity; Moment problem; Optimization of polynomials; Positive polynomial; Positivstellensatz; Quadratic module; Sum of squares

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; POLYNOMIALS;

MOMENT PROBLEMS; OPTIMIZATION OF POLYNOMIALS; POSITIVE POLYNOMIALS; POSITIVSTELLENSATZ; QUADRATIC MODULES; SUM OF SQUARES;

COMPUTATIONAL COMPLEXITY;

EID: 33846794429     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2006.07.002     Document Type: Article

References (26)

1. Bochnak J., Coste M., and Roy M.-F. Real algebraic geometry. Ergebnisse der Mathematik und ihrer Grenzgebiete vol. 36 (1998), Springer, Berlin
2. J. Demmel, J. Nie, V. Powers, Representations of positive polynomials on non-compact semialgebraic sets via KKT ideals, J. Pure Appl. Algebra, to appear 〈http://math.berkeley.edu/∼njw/〉.
3. D. Henrion, J. Lasserre, GloptiPoly: global optimization over polynomials with Matlab and SeDuMi 〈http://www.laas.fr/∼henrion/software/gloptipoly/〉.
4. Jacobi T., and Prestel A. Distinguished representations of strictly positive polynomials. J. Reine Angew. Math. 532 (2001) 223-235
5. Jibetean D., and Laurent M. Semidefinite approximations for global unconstrained polynomial optimization. SIAM J. Optim. 16 2 (2005) 490-514
6. Kojima M., Kim S., and Waki H. Sparsity in sums of squares of polynomials. Math. Program. 103 1A (2005) 45-62. http://www.is.titech.ac.jp/~kojima/SparsePOP/ 〈http://www.is.titech.ac.jp/∼kojima/SparsePOP/〉
7. Lasserre J. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 3 (2001) 796-817
8. J. Löfberg, YALMIP: A MATLAB toolbox for rapid prototyping of optimization problems 〈http://control.ee.ethz.ch/∼joloef/yalmip.php〉.
9. Marshall M. Optimization of polynomial functions. Can. Math. Bull. 46 4 (2003) 575-587
10. M. Marshall, Representation of non-negative polynomials with finitely many zeros, Ann. Faculté Sci. Toulouse, Sér. 6, 15 (3) (2006) 599-609.
11. Nie J., Demmel J., and Sturmfels B. Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. 106 3A (2006) 587-606
12. Parrilo P., and Sturmfels B. Minimizing polynomial functions. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 60 (2003) 83-100
13. Pólya G. Über positive Darstellung von Polynomen. Vierteljahresschrift der Naturforschenden Gesellschaft in Zürich 73 (1928) 141-145 Reprinted in: Collected Papers, vol. 2, MIT Press, Cambridge, 1974, pp. 309-313
14. Powers V., and Reznick B. A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. J. Pure Appl. Algebra 164 1-2 (2001) 221-229
15. S. Prajna, A. Papachristodoulou, P. Seiler, P. Parrilo, SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB 〈http://www.cds.caltech.edu/sostools/〉.
16. Prestel A. Bounds for representations of polynomials positive on compact semi-algebraic sets. Fields Inst. Commun. 32 (2002) 253-260
17. Prestel A., and Delzell C. Positive Polynomials, Springer Monographs in Mathematics (2001), Springer, Berlin
18. Putinar M. Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42 3 (1993) 969-984
19. Scheiderer C. Distinguished representations of non-negative polynomials. J. Algebra 289 2 (2005) 558-573
20. Schmüdgen K. The K-moment problem for compact semi-algebraic sets. Math. Ann. 289 2 (1991) 203-206
21. Schweighofer M. An algorithmic approach to Schmüdgen's Positivstellensatz. J. Pure Appl. Algebra 166 3 (2002) 307-319
22. Schweighofer M. On the complexity of Schmüdgen's Positivstellensatz. J. Complexity 20 (2004) 529-543
23. Schweighofer M. Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15 3 (2005) 805-825
24. Schweighofer M. Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets. Manuscripta Math. 117 4 (2005) 407-428
25. Stengle G. Complexity estimates for the Schmüdgen Positivstellensatz. J. Complexity 12 2 (1996) 167-174
26. Todd M. Semidefinite optimization. Acta Numer. 10 (2001) 515-560