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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8125 LNCS, Issue , 2013, Pages 217-228

  Briët, Jop ^a   Dadush, Daniel ^a   Pokutta, Sebastian ^b  

^a NEW YORK UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

extended formulations; extension complexity; semidefinite extended formulations

Indexed keywords

AFFINE SPACE; EXTENDED FORMULATIONS; EXTENSION COMPLEXITY; HIGHER-DIMENSIONAL; LINEAR EXTENSIONS; POLYTOPES; SEMIDEFINITE CONES;

ALGORITHMS;

TOPOLOGY;

EID: 84884341326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40450-4_19     Document Type: Conference Paper

References (15)

1. Rothvoß, T.: Some 0/1 polytopes need exponential size extended formulations. Math. Programming, arXiv:1105.0036 (2012)
2. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. In: Proceedings of STOC 2012 (2012)
3. Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation Limits of Linear Programs (Beyond Hierarchies). In: 53rd IEEE Symp. on Foundations of Computer Science (FOCS 2012), pp. 480-489 (2012)
4. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3), 441-466 (1991)
5. Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26, 193-205 (2001)
6. Fiorini, S., Rothvoß, T., Tiwary, H.R.: Extended formulations for polygons. Discrete & Computational Geometry 48(3), 658-668 (2012)
7. Goemans, M.X.: Smallest compact formulation for the permutahedron. Manuscript (2009)
8. Yannakakis, M.: Expressing combinatorial optimization problems by linear programs (extended abstract). In: Proc. STOC 1988, pp. 223-228 (1988)
9. Gouveia, J., Parrilo, P.A., Thomas, R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38(2), 248-264 (2011)
10. Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell System Tech. J. 25, 59-98 (1949)
11. Braverman, M., Moitra, A.: An information complexity approach to extended formulations. Electronic Colloquium on Computational Complexity (ECCC) 19(131) (2012)
12. Faenza, Y., Fiorini, S., Grappe, R., Tiwary, H.R.: Extended formulations, nonnegative factorizations, and randomized communication protocols. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 129-140. Springer, Heidelberg (2012)
13. Braun, G., Pokutta, S.: Common information and unique disjointness (submitted, 2013)
14. John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays presented to R. Courant on his 60th Birthday, pp. 187-204 (1948)
15. Günter, M.: Lectures on 0/1-Polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes - Combinatorics and Computation. DMV Seminar, vol. 29, pp. 1-41. Birkhäuser Basel (2000)