A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
Abstract. 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´asz.
|, , , , , , ,|
|Cornell University Library|
|arXiv.org e-Print archive|
|Semidefinite programming and combinatorial optimization|
|Organisation||Networks and Optimization|
Gouveia, J, Laurent, M, Parrilo, P, & Thomas, R.R. (2009). A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. arXiv.org e-Print archive. Cornell University Library .