Lifts of convex sets and cone factorizations

Mathematics of Operations Research

Volumn 38, Issue 2, 2013, Pages 248-264

  Gouveia, João ^a   Parrilo, Pablo A ^b   Thomas, Rekha R ^c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b USA   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Cone factorization; Convex set; Lifts; Nonnegative rank; Polytope; Positive semidefinite rank

Indexed keywords

CONVEX SET; LINEAR MAPS; LINEAR OPTIMIZATION; NON NEGATIVES; NON-NEGATIVE FACTORIZATION; POLYTOPES; POSITIVE SEMIDEFINITE; POSITIVE SEMIDEFINITE MATRICES;

ALGORITHMS; CONES; FACTORIZATION; LIFT; OPTIMIZATION;

SET THEORY;

EID: 84878270398     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1120.0575     Document Type: Article

References (30)

1. Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5: 3-51.
2. Barvinok A (2002) A Course in Convexity, Graduate Studies in Mathematics, Vol. 54. (American Mathematical Society, Providence, RI).
3. Barvinok A (2012) Approximations of convex bodies by polytopes and by projections of spectrahedra. ArXiv:1204.0471.
4. Baston VJD (1969) Extreme copositive quadratic forms. Acta Arithmetica XV: 319-327.
5. Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization, MPS/SIAM Series on Optimization. (Society for Industrial and Applied Mathematics (SIAM), Philadelphia).
6. Ben-Tal A, Nemirovski A (2001) On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2): 193-205.
7. Bienstock D, Zuckerberg M (2004) Subset algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15(1): 63-95.
8. Borwein J, Wolkowicz H (1981) Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2): 495-530.
9. Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Programming 120(2, Ser. A): 479-495.
10. Cohen JE, Rothblum UG (1993) Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190: 149-168.
11. Fiorini S, Kaibel V, Pashkovich K, Theis DO (2013) Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1): 67-83.
12. Fiorini S, Massar S, Pokutta S, Tiwary HR, de Wolf R (2012) Linear vs. semidefinite extended formulations: Exponential separation and strong lower bounds. Proc. 44th Sympos. Theory Comput., STOC '12 (ACM, New York), 95-106.
13. Gillis N, Glineur F (2012) On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11): 2685-2712.
14. Goemans M (2009) Smallest compact formulation for the permutahedron. http://www-math.mit.edu/~goemans/publ.html.
15. Gouveia J, Parrilo PA, Thomas RR (2010) Theta bodies for polynomial ideals. SIAM J. Optim. 20(4): 2097-2118.
16. Gouveia J, Robinson RZ, Thomas RR (2012) Polytopes of minimum positive semidefinite rank. ArXiv:1205.5306.
17. Kaibel V, Pashkovich K, Theis DO (2010) Symmetry matters for the sizes of extended formulations. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 6080 (Springer, Berlin), 135-148.
18. Kojima M, Tunçel L (2000) Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10(3): 750-778.
19. Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3): 796-817.
20. Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1(2): 166-190.
21. Marshall M (2008) Positive Polynomials and Sums of Squares, Mathematical Surveys and Monographs, Vol. 146 (American Mathematical Society, Providence, RI).
22. Nesterov YE, Nemirovski A (1994) Interior Point Polynomial Methods in Convex Programming, Studies in Applied Mathematics, Vol. 13. (SIAM, Philadelphia).
23. Parrilo PA (2003) Semidefinite programming relaxations for semialgebraic problems. Math. Programming 96(2, Ser. B): 293-320.
24. Pashkovich K (2009) Symmetry in extended formulations of the permutahedron. ArXiv:0912.3446.
25. Pataki G (2013) On the connection of facially exposed, and nice cones. J. Math. Analysis and Applications 400(1): 211-221.
26. Renegar J (1992) On the computational complexity and geometry of the first-order theory of the reals. I. Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symbolic Comput. 13(3): 255-299.
27. Renegar J (2006) Hyperbolic programs, and their derivative relaxations. Foundations Comput. Math. 6(1): 59-79.
28. Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3): 411-430.
29. Vavasis SA (2009) On the complexity of nonnegative matrix factorization. SIAM J. Optim. 20(3): 1364-1377.
30. Yannakakis M (1991) Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43(3): 441-466.