Lower Bounds on the Size of Semidefinite Programming Relaxations

@inproceedings{Lee2015LowerBO,
  title={Lower Bounds on the Size of Semidefinite Programming Relaxations},
  author={James R. Lee and Prasad Raghavendra and David Steurer},
  booktitle={STOC},
  year={2015}
}
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on n-vertex graphs are not the linear image of the feasible region of any SDP (i.e., any spectrahedron) of dimension less than 2nδ, for some constant δ > 0. This result yields the first super-polynomial lower bounds on the semidefinite extension complexity of any explicit family of polytopes… CONTINUE READING
Highly Cited
This paper has 125 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

125 Citations

0204020142015201620172018
Citations per Year
Semantic Scholar estimates that this publication has 125 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…