Polynomial programming: LP-relaxations also converge

SIAM Journal on Optimization

Volumn 15, Issue 2, 2005, Pages 383-393

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Global optimization; Linear programming relaxations; Real algebraic geometry; Semidefinite programming relaxations

Indexed keywords

LINEARIZATION; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; RELAXATION PROCESSES;

FINITE CONVERGENCE; LINEAR PROGRAMMING RELAXATIONS; REAL ALGEBRAIC GEOMETRY; SEMIDEFINITE PROGRAMMING RELAXATIONS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 18744415993     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040603942     Document Type: Article

References (26)

1. E. BECKER AND N. SCHWARTZ, Zum Darstellungssatz von Kadison-Dubois, Arch. Math. (Basel), 40 (1983), pp. 421-428.
2. n et décomposition de polynômes à plusieurs variables, J. Funct. Anal., 58 (1984), pp. 254-266.
3. S. CERIA, E. BALAS, AND G. CORNUEJOLS, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Programming, 58 (1993), pp. 295-324.
4. D. HANDELMAN, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific J. Math., 132 (1988), pp. 35-62.
5. D. HENRION AND J. B. LASSERRE, GloptiPoly: Global optimization over polynomials with Mat-lab and SeDuMi, ACM Trans. Math. Software, 29 (2003), pp. 165-194.
6. D. HENRION AND J. B. LASSERRE, Solving nonconvex optimization problems, IEEE Control Systems Magazine, 24 (2004), pp. 72-83.
7. T. JACOBI AND A. PRESTEL, Distinguished representations of strictly positive polynomials, J. Reine Angew. Math., 532 (2001), pp. 223-235.
8. J. L. KRIVINE, Anneaux préordonnés, J. Analyse Math., 12 (1964), pp. 307-326.
9. J. L. KRIVINE, Quelques propriétés des préordres dans les anneaux commutatifs unitaires, C.R. Acad. Sci. Paris, 258 (1964), pp. 3417-3418.
10. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim, 11 (2001), pp. 796-817.
11. J. B. LASSERRE, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J. Optim., 12 (2002), pp. 756-769.
12. J. B. LASSERRE, Semidefinite programming vs. LP relaxations for polynomial programming, Math. Oper. Res., 27 (2002), pp. 347-360.
13. J. B. LASSERRE AND T. PRIETO RUMEAU, SDP vs LP-relaxations for the moment approach in some performance evaluation problems, Stoch. Models, 20 (2004), pp. 439-456.
14. J. B. LASSERRE, T. PRIETO RUMEAU, AND M. ZERVOS, Pricing a Class of Exotic Options Via Moments and SDP Relaxations, Tech. report 03125, LAAS-CNRS, Toulouse, France, 2003.
15. M. LAURENT, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming, Math. Oper. Res., 28 (2003), pp. 470-496.
16. M. LAURENT, Semidefinite representations for finite varieties, Math. Progr., to appear.
17. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
18. M. MARSHALL, A general representation theorem for partially ordered commutative rings, Math. Z., 242 (2002), pp. 217-225.
19. P. PARRILO, An Explicit Construction of Distinguished Representations of Polynomials Non-negative over Finite Sets, Tech. report AUTO 2-02, ETH, Zurich, Switzerland, 2002.
20. P. PARRILO AND B. STURMFELS, Minimizing polynomial functions, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 60, AMS, Providence, RI, 2003, pp. 83-100.
21. M. PUTINAR, Positive polynomials on compact semi-algebraic sets, Indiana Univ. Math. J., 42 (1993), pp. 969-984.
22. K. SCHMÜDGEN, The K-moment problem for compact semi-algebraic sets, Math. Ann., 289 (1991), pp. 203-206.
23. M. SCHWEIGHOFER, Optimization of polynomials on compact semialgrebraic sets, SIAM J. Optim., to appear.
24. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
25. H. D. SHERALI AND W. P. ADAMS, A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Kluwer Academic Publishers, Boston, 1999.
26. F.-H. VASILESCU, Spectral measures and moment problems, in Spectral Theory and Its Applications, Theta Foundation, Bucharest, Romania, 2003, pp. 173-215.