Lifts of Convex Sets and Cone Factorizations

In this paper, we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or lift of the convex set is especially useful if the cone admits an efficient algorithm for linear optimization over its affine slices. We show that the existence of a lift of a convex set to a cone is equivalent to the existence of a factorization of an operator associated to the set and its polar via elements in the cone and its dual. This generalizes a theorem of Yannakakis that established a connection between polyhedral lifts of a polytope and nonnegative factorizations of its slack matrix. Symmetric lifts of convex sets can also be characterized similarly. When the cones live in a family, our results lead to the definition of the rank of a convex set with respect to this family. We present results about this rank in the context of cones of positive semidefinite matrices. Our methods provide new tools for understanding cone lifts of convex sets.

[1]  V. Baston.  Extreme copositive quadratic forms , 1969 .

[2]  J. Borwein,et al.  Regularizing the Abstract Convex Program , 1981 .

[3]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

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

[5]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[6]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[7]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[8]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[9]  Joel E. Cohen,et al.  Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[10]  Masakazu Kojima,et al.  Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets , 1999, SIAM J. Optim..

[11]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[12]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

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

[14]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[15]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[16]  Daniel Bienstock,et al.  Subset Algebra Lift Operators for 0-1 Integer Programming , 2004, SIAM J. Optim..

[17]  James Renegar,et al.  Hyperbolic Programs, and Their Derivative Relaxations , 2006, Found. Comput. Math..

[18]  M. Marshall.  Positive polynomials and sums of squares , 2008 .

[19]  Kanstantsin Pashkovich.  Symmetry in Extended Formulations of the Permutahedron , 2009 .

[20]  Stephen A. Vavasis,et al.  On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..

[21]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[22]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[23]  Rekha R. Thomas,et al.  Theta Bodies for Polynomial Ideals , 2008, SIAM J. Optim..

[24]  Dirk Oliver Theis,et al.  Symmetry Matters for the Sizes of Extended Formulations , 2010, IPCO.

[25]  Volker Kaibel,et al.  Constructing Extended Formulations from Reflection Relations , 2010, IPCO.

[26]  Nicolas Gillis,et al.  On the Geometric Interpretation of the Nonnegative Rank , 2010, 1009.0880.

[27]  Hans Raj Tiwary,et al.  Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds , 2011, STOC '12.

[28]  G. Pataki.  On the connection of facially exposed and nice cones , 2012, 1202.4043.

[29]  A. Barvinok.  Approximations of convex bodies by polytopes and by projections of spectrahedra , 2012, 1204.0471.

[30]  Rekha R. Thomas,et al.  Polytopes of Minimum Positive Semidefinite Rank , 2012, Discret. Comput. Geom..

[31]  Samuel Fiorini,et al.  Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..

[32]  Kanstantsin Pashkovich.  Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results , 2014, Math. Oper. Res..

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

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