On the existence of 0/1 polytopes with high semidefinite extension complexity

In Rothvoß (Math Program 142(1–2):255–268, 2013) it was shown that there exists a 0/1 polytope (a polytope whose vertices are in $$\{0,1\}^{n}$${0,1}n) such that any higher-dimensional polytope projecting to it must have $$2^{\varOmega (n)}$$2Ω(n) facets, i.e., its linear extension complexity is exponential. The question whether there exists a 0/1 polytope with high positive semidefinite extension complexity was left open. We answer this question in the affirmative by showing that there is a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a semidefinite cone of dimension $$2^{\varOmega (n)}$$2Ω(n) and an affine space. Our proof relies on a new technique to rescale semidefinite factorizations.

[1]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[2]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[3]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[4]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[5]  Hans Raj Tiwary,et al.  Extended Formulations for Polygons , 2011, Discret. Comput. Geom..

[6]  F. John Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .

[7]  Sebastian Pokutta,et al.  Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[8]  Joseph H. Silverman,et al.  Diophantine Geometry: An Introduction , 2000 .

[9]  M. Ziegler Volume 152 of Graduate Texts in Mathematics , 1995 .

[10]  Mihalis Yannakakis,et al.  Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) , 1988, Symposium on the Theory of Computing.

[11]  Rekha R. Thomas,et al.  Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..

[12]  Hans Raj Tiwary,et al.  Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols , 2012, ISCO.

[13]  G. Ziegler Lectures on 0/1-Polytopes , 1999, math/9909177.

[14]  Samuel Fiorini,et al.  Approximation Limits of Linear Programs (Beyond Hierarchies) , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[15]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[16]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[17]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[18]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[19]  Tosio Kato Perturbation theory for linear operators , 1966 .

[20]  Hans Raj Tiwary,et al.  Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.