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

Author(s)
Gouveia, João; Laurent, Monique; Parrilo, Pablo A.; Thomas, Rekha
Thumbnail
DownloadParillo_A new.pdf (310.3Kb)
PUBLISHER_CC
Terms of use
Creative Commons Attribution Noncommercial License http://creativecommons.org/licenses/by-nc/2.5
Metadata
Show full item record
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ász.
Date issued
2010-10
URI
http://hdl.handle.net/1721.1/62821
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Journal
Mathematical programming
Publisher
Springer
Citation
Gouveia, João et al. “A New Semidefinite Programming Hierarchy for Cycles in Binary Matroids and Cuts in Graphs.” Mathematical Programming (2010) : 1-23-23. Print.
Version: Final published version
ISSN
0025-5610
Collections