Semidefinite programming relaxations for semialgebraic problems

Abstract. A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number of polynomial equalities and inequalities, it is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility. The main tools employed are a semidefinite programming formulation of the sum of squares decomposition for multivariate polynomials, and some results from real algebraic geometry. The techniques provide a constructive approach for finding bounded degree solutions to the Positivstellensatz, and are illustrated with examples from diverse application fields.

[1]  P. H. Diananda.  On non-negative forms in real variables some or all of which are non-negative , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  N. Bose,et al.  A quadratic form representation of polynomials of several variables and its applications , 1968 .

[3]  G. Stengle.  A nullstellensatz and a positivstellensatz in semialgebraic geometry , 1974 .

[4]  B. Reznick.  Extremal PSD forms with few terms , 1978 .

[5]  N. Bose.  Applied multidimensional systems theory , 1982 .

[6]  H. Väliaho.  Criteria for copositive matrices , 1986 .

[7]  W. Brownawell.  Bounds for the degrees in the Nullstellensatz , 1987 .

[8]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[9]  N. Z. Shor.  Class of global minimum bounds of polynomial functions , 1987 .

[10]  J. Kollár.  Sharp effective Nullstellensatz , 1988 .

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

[12]  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..

[13]  C. Berenstein,et al.  Recent improvements in the complexity of the effective Nullstellensatz , 1991 .

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

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

[16]  N. V. Ilyushechkin.  Discriminant of the characteristic polynomial of a normal matrix , 1992 .

[17]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[18]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[19]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[20]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of quantifier elimination , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  László Lovász,et al.  Stable sets and polynomials , 1994, Discret. Math..

[22]  B. Reznick,et al.  Sums of squares of real polynomials , 1995 .

[23]  B. Reznick.  Uniform denominators in Hilbert's seventeenth problem , 1995 .

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

[25]  G. Stengle.  Complexity Estimates for the Schmudgen Positivstellensatz , 1996 .

[26]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of quantifier elimination , 1996, JACM.

[27]  M. A. Hasan,et al.  A procedure for the positive definiteness of forms of even order , 1996, IEEE Trans. Autom. Control..

[28]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

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

[30]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[31]  A. J. Quist,et al.  Copositive realxation for genera quadratic programming , 1998 .

[32]  M. Fu.  Comments on "A procedure for the positive definiteness of forms of even order" , 1998, IEEE Trans. Autom. Control..

[33]  V. Powers,et al.  An algorithm for sums of squares of real polynomials , 1998 .

[34]  A. J. Quist,et al.  Copositive relaxation for general quadratic programming. , 1998 .

[35]  C. Ferrier.  Hilbert’s 17th problem and best dual bounds in quadratic minimization , 1998 .

[36]  P. Lax.  On the discriminant of real symmetric matrices , 1998 .

[37]  N. Shor.  Nondifferentiable Optimization and Polynomial Problems , 1998 .

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

[39]  P. Parrilo.  On a decomposition of multivariable forms via LMI methods , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[40]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[41]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

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

[43]  Dima Grigoriev,et al.  Complexity of Null-and Positivstellensatz proofs , 2001, Ann. Pure Appl. Log..

[44]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

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

[46]  P. Parrilo.  An explicit construction of distinguished representations of polynomials nonnegative over finite sets , 2002 .

[47]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[48]  Peter J Seiler,et al.  SOSTOOLS: Sum of squares optimization toolbox for MATLAB , 2002 .

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

[50]  S. Basu,et al.  Algorithmic and Quantitative Real Algebraic Geometry: DIMACS Workshop, Algorithmic and Quantitative Aspects of Real Algebraic, Geometry in Mathematics and Computer Science, March 12-16, 2001, DIMACS Center , 2003 .

[51]  P. Parrilo,et al.  Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.