Theta Bodies for Polynomial Ideals

Inspired by a question of Lovasz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal called theta bodies of the ideal. These relaxations generalize Lovasz's construction of the theta body of a graph. We establish a relationship between theta bodies and Lasserre's relaxations for real varieties which allows, in many cases, for theta bodies to be expressed as feasible regions of semidefinite programs. Examples from combinatorial optimization are given. Lovasz asked to characterize ideals for which the first theta body equals the closure of the convex hull of its real variety. We answer this question for vanishing ideals of finite point sets via several equivalent characterizations. We also give a geometric description of the first theta body for all ideals.

[1]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[2]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[3]  Franz Rendl,et al.  Semidefinite programming and integer programming , 2002 .

[4]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[5]  M. Laurent.  Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

[6]  M. Marshall.  Positive polynomials and sums of squares , 2008 .

[7]  Monique Laurent,et al.  Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals , 2008, Found. Comput. Math..

[8]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[9]  Rekha R. Thomas,et al.  A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs , 2009, Math. Program..

[10]  Monique Laurent,et al.  Semidefinite representations for finite varieties , 2007, Math. Program..

[11]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[12]  Seth Sullivant.  Compressed polytopes and statistical disclosure limitation , 2004 .

[13]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

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

[15]  J. William Helton,et al.  Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets , 2007, SIAM J. Optim..

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  Richard P. Stanley,et al.  Decompositions of Rational Convex Polytopes , 1980 .

[18]  P. Parrilo.  Exploiting Algebraic Structure in Sum of Squares Programs , 2005 .

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

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

[21]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[22]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[24]  Jean B. Lasserre,et al.  Convex sets with semidefinite representation , 2009, Math. Program..

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

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

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

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

[29]  Adrian S. Lewis,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

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

[31]  Monique Laurent,et al.  Semidefinite Relaxations for Max-Cut , 2004, The Sharpest Cut.

[32]  László Lovász,et al.  Semidefinite Programs and Combinatorial Optimization , 2003 .

[33]  J. Borwein,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[34]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

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

[36]  Grant Schoenebeck,et al.  Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

[38]  Victoria Powers,et al.  The moment problem for non-compact semialgebraic sets , 2001 .

[39]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..