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

  title={A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs},
  author={Jo{\~a}o Gouveia and Monique Laurent and Pablo A. Parrilo and Rekha R. Thomas},
  journal={Mathematical Programming},
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… 
Cycle algebras and polytopes of matroids
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes
A semidefinite approach to the Ki-cover problem
Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
A representation-theoretic framework is presented to study equivariant PSD lifts of a certain class of symmetric polytopes known as orbitopes which respect the symmetries of the polytope.
Chapter 7: Spectrahedral Approximations of Convex Hulls of Algebraic Sets
This chapter describes a method for finding spectrahedral approximations of the convex hull of a real algebraic variety (the set of real solutions to a finite system of polynomial equations). The
On some problems related to 2-level polytopes
This thesis investigates a number of problems related to 2-level polytopes, in particular regarding their combinatorial structure and extension complexity, and gives an output-efficient algorithm to write down extended formulations for the stable set polytope of perfect graphs.
A Semidefinite Approach to the $K_i$ Cover Problem
We apply theta body relaxations to the $K_i$-cover problem and show polynomial time solvability for certain classes of graphs. In particular, we give an effective relaxation where all $K_i$-$p$-hole
Equivariant Semidefinite Lifts of Regular Polygons
This paper shows that one can construct an equivariant psd lift of the regular 2^n-gon of size 2n-1, which is exponentially smaller than the psd Lift of the sum-of-squares hierarchy, and proves that the construction is essentially optimal.
Convex Hulls of Algebraic Sets
This article describes a method to compute successive convex approximations of the convex hull of the solutions to a system of polynomial equations over the reals. The method relies on sums of
Matrix convex hulls of free semialgebraic sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix


Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
It is shown that [ n/2] iterations are needed for finding the cut polytope of the complete graphK n and that such a relaxation can be expressed as a projection of such a semidefinite relaxation after at mostn steps.
Theta Bodies for Polynomial Ideals
A hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal called theta bodies of the ideal is introduced and a geometric description of the first theta body for all ideals is given.
Decomposition and optimization over cycles in binary matroids
On the cycle polytope of a binary matroid
Semidefinite programming relaxations for semialgebraic problems
  • P. Parrilo
  • Mathematics, Computer Science
    Math. Program.
  • 2003
It is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility and provide a constructive approach for finding bounded degree solutions to the Positivstellensatz.
Semidefinite programming and integer programming
Semidefinite representations for finite varieties
  • M. Laurent
  • Mathematics, Computer Science
    Math. Program.
  • 2007
This work proves the finite convergence of a hierarchy of semidefinite relaxations introduced by Lasserre, which involves combinatorial moment matrices indexed by a basis of the quotient vector space ℝ[x1, . . . ,xn]/I.
On the cut polytope
It is shown that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented.
Semidefinite Programming
A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given.