Semidefinite Programming vs. LP Relaxations for Polynomial Programming

We consider the global minimization of a multivariate polynomial on a semi-algebraic set O defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comparison is analyzed in light of recent results in real algebraic geometry on various representations of polynomials, positive on a compact semi-algebraic set.

[1]  J. Shohat,et al.  The problem of moments , 1943 .

[2]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[4]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[5]  C. Berg.  The multidimensional moment problem and semi-groups , 1987 .

[6]  D. Handelman.  Representing polynomials by positive linear functions on compact convex polyhedra. , 1988 .

[7]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[8]  M. Er.  Quadratic optimization problems in robust beamforming , 1990 .

[9]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[10]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[11]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[12]  L. Fialkow,et al.  RECURSIVENESS, POSITIVITY, AND TRUNCATED , 1991 .

[13]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[14]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[17]  Hanif D. Sherali,et al.  New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems , 1997, Oper. Res. Lett..

[18]  B. Simon.  The Classical Moment Problem as a Self-Adjoint Finite Difference Operator , 1998, math-ph/9906008.

[19]  Yurii Nesterov,et al.  Squared Functional Systems and Optimization Problems , 2000 .

[20]  O. SIAMJ..  CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS , 2000 .

[21]  B. Reznick,et al.  Polynomials that are positive on an interval , 2000 .

[22]  Pierre Hansen,et al.  A branch and cut algorithm for nonconvex quadratically constrained quadratic programming , 1997, Math. Program..

[23]  Vanderbei Robert,et al.  On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems , 2000 .

[24]  R. Curto,et al.  The truncated complex -moment problem , 2000 .

[25]  A. Prestel,et al.  Distinguished representations of strictly positive polynomials , 2001 .

[26]  B. Reznick,et al.  A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra , 2001 .

[27]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[28]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[29]  Hanif D. Sherali,et al.  Enhancing RLT relaxations via a new class of semidefinite cuts , 2002, J. Glob. Optim..

[30]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[31]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..