A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avoids certain minors we can characterize when the first theta body in the hierarchy equals the cycle polytope of the matroid. Specialized to cuts in graphs, this result solves a problem posed by Lovász.

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

[2]  Rekha R. Thomas,et al.  Theta Bodies for Polynomial Ideals , 2008, SIAM J. Optim..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[6]  Klaus Truemper,et al.  Master polytopes for cycles of binary matroids , 1989 .

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

[8]  James G. Oxley,et al.  Matroid theory , 1992 .

[9]  Marie-Françoise Roy,et al.  Witt Rings in Real Algebraic Geometry , 1998 .

[10]  Klaus Truemper,et al.  Decomposition and optimization over cycles in binary matroids , 1989, J. Comb. Theory, Ser. B.

[11]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

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

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

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

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

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

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

[18]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

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

[20]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[21]  Angelika Wiegele.  Nonlinear optimization techniques applied to combinatorial optimization problems / Angelika Wiegele , 2006 .

[22]  Monique Laurent,et al.  Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope , 2003, Math. Oper. Res..

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

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

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

[26]  Francisco Barahona,et al.  On the cycle polytope of a binary matroid , 1986, J. Comb. Theory, Ser. B.

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

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

[29]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..