Semidefinite approximations for global unconstrained polynomial optimization

SIAM Journal on Optimization

Volumn 16, Issue 2, 2006, Pages 490-514

  Jibetean, Dorina ^a   Laurent, Monique ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Approximation algorithm; Global optimization; Moment matrix; Positive polynomial; Semidefinite programming; Sum of squares of polynomials

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; METHOD OF MOMENTS; PERTURBATION TECHNIQUES; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; MOMENT MATRIX; POSITIVE POLYNOMIALS; SEMIDEFINITE PROGRAMMING; SUM OF SQUARES OF POLYNOMIALS;

GLOBAL OPTIMIZATION;

EID: 33646731856     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/04060562X     Document Type: Article

References (28)

1. S. BASU, R. POLLACK, AND M.-F. ROY, Algorithms in Real Algebraic Geometry, Springer-Verlag, Berlin, 2003.
2. D. COX, J. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms, 2nd ed., Springer-Verlag, New York, 1997.
3. D. COX, J. LITTLE, AND D. O'SHEA, Using Algebraic Geometry, Grad. Texts in Math. 185, Springer-Verlag, New York, 1998.
4. R. E. CURTO AND L. A. FIALKOW, Solution of the truncated complex moment problem for flat data, Mem. Amer. Math. Soc., 119 (1996).
5. R. E. CURTO AND L. A. FIALKOW, The truncated complex K-moment problem, Trans. Amer. Math. Soc., 352 (2000), pp. 2825-2855.
6. J. W. DEMMEL, J. NIE, AND B. STURMFELS, Minimizing polynomials via sum of squares over the gradient ideal, available online from http://arxiv.org/abs/ math.OC/0411342, 2004.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, CA, 1979.
8. K. HÄGGLÖF, P. O. LINDBERG, AND L. STENVENSON, Computing global minima to polynomial optimization problems using Gröbner bases, J. Global Optim., 7 (1995), pp. 115-125.
9. B. HANZON AND D. JIBETEAN, Global minimization of a multivariate polynomial using matrix methods, J. Global Optim., 27 (2003), pp. 1-23.
10. D. HENRION AND J.-B. LASSERRE, GloptiPoly: Global optimization over polynomials with MATLAB and SeDuMi, ACM Trans. Math. Software, 29 (2003), pp. 165-194.
11. D. HENRION AND J.-B. LASSERRE, Detecting global optimality and extracting solutions in GloptiPoly, in Positive Polynomials in Control, Lecture Notes in Control and Inform. Sci. 312, D. Henrion and A. Garulli, eds., Springer-Verlag, Berlin, 2005, pp. 293-310.
12. D. JIBETEAN, Algebraic Optimization with Applications to System Theory, Ph.D. thesis, Vrije Universiteit, Amsterdam, The Netherlands, 2003.
13. W. KAPLAN, A test for copositive matrices, Linear Algebra Appl., 313 (2000), pp. 203-206.
14. E. DE KLERK, M. LAURENT, AND P. PARRILO, On the equivalence of algebraic approaches to the minimization of forms over the simplex, in Positive Polynomials in Control, Lecture Notes in Control and Inform. Sci. 312, D. Henrion and A. Garulli, eds., Springer-Verlag, Berlin, 2005, pp. 121-133.
15. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
16. J. B. LASSERRE, A New Hierarchy of SDP-Relaxations for Polynomial Programming, Preprint, 2004.
17. M. LAURENT, Revisiting two theorems of Curio and Fialkow on moment matrices, Proc. Amer. Math. Soc., 133 (2005), pp. 2965-2976.
18. M. LAURENT, Semidefinite representations for finite varieties, Math. Program., to appear.
19. M. MARSHALL, Optimization of polynomial functions, Canad. Math. Bull., 46 (2003), pp. 575-587.
20. T. S. MOTZKIN AND E. G. STRAUS, Maxima for graphs and a new proof of a theorem of Túran, Canad. J. Math., 17 (1965), pp. 533-540.
21. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Math. Program., 39 (1987), pp. 117-129.
22. P. A. PARRILO, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 2000.
23. P. A. PARRILO, Semidefinite programming relaxations for semialgebraic problems, Math. Program., 96 (2003), pp. 293-320.
24. P. PARRILO, An Explicit Construction of Distinguished Representations of Polynomials Non-negative over Finite Sets, Preprint, ETH, Zürich, 2002.
25. P. A. PARRILO AND B. STURMFELS, Minimizing polynomial functions, in Algorithmic and Quantitative Real Algebraic Geometry, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 60, S. Basu and L. Gonzales-Vega, eds., AMS, Providence, RI, 2003, pp. 83-99
26. M. PUTINAR, Positive polynomials on compact semialgebraic sets, Indiana Univ. Math. J., 42 (1993), pp. 969-984.
27. B. REZNICK, Uniform denominators in Hilbert's 17th problem, Math. Z., 220 (1995), pp. 75-97.
28. N. SHOR, Class of global minimum bounds of polynomial functions, Translated from Kibernet-ica, 6 (1987), pp. 9-11.