Equivariant semidefinite lifts and sum-of-squares hierarchies

Hamza Fawzi, James Saunderson, Pablo A. Parrilo

Research output: Contribution to journalArticleResearchpeer-review

8 Citations (Scopus)

Abstract

A central question in optimization is to maxim ize (or minimize) a linear function over a given polytope P. To solve such a problem in practice one needs a concise description of the polytope P. In this paper we are interested in representations of P using the positive semidefinite cone: a positive semidefinite lift (PSD lift) of a polytope P is a representation of P as the projection of an affine slice of the positive semidefinite cone Sd+. Such a representation allows linear optimization problems over P to be written as semidefinite programs of size d. Such representations can be beneficial in practice when d is much smaller than the number of facets of the polytope P. In this paper we are concerned with so-called equivariant PSD lifts (also known as symmetric PSD lifts) which respect the symmetries of the polytope P. We present a representation-theoretic framework to study equivariant PSD lifts of a certain class of symmetric polytopes known as orbitopes. Our main result is a structure theorem where we show that any equivariant PSD lift of size d of an orbitope is of sum-of-squares type where the functions in the sum-of-squares decomposition come from an invariant subspace of dimension smaller than d3. We use this framework to study two well-known families of polytopes, namely the parity polytope and the cut polytope, and we prove exponential lower bounds for equivariant PSD lifts of these polytopes.

Original languageEnglish
Pages (from-to)2212-2243
Number of pages32
JournalSIAM Journal on Optimization
Volume25
Issue number4
DOIs
Publication statusPublished - 2015
Externally publishedYes

Keywords

  • Equivalent lifts
  • Extended formulations
  • Semidefinite programming
  • Sum-of-squares

Cite this