  


A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
Joćo Gouveia (jgouveiau.washington.edu) 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{\'a}sz. Keywords: Semidefinite programming, theta bodies, maxcut problem, binary matroid Category 1: Linear, Cone and Semidefinite Programming Category 2: Combinatorial Optimization Citation: Preprint, July/09 Download: [PDF] Entry Submitted: 07/26/2009 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  