Equivariant semidefinite lifts of regular polygons
Hamza Fawzi, James Saunderson, Pablo A. Parrilo

TL;DR
This paper investigates equivariant positive semidefinite lifts of regular polygons, demonstrating constructions that are exponentially smaller than sum-of-squares hierarchies and establishing lower bounds on lift sizes.
Contribution
It introduces a novel construction of small equivariant psd lifts for regular polygons and proves bounds that highlight the gap between LP and psd lift sizes.
Findings
Sum-of-squares hierarchy requires ceil(N/4) iterations for regular N-gon.
Constructed equivariant psd lift of size 2n-1 for 2^n-gon, exponentially smaller than SOS.
Any equivariant psd lift of a regular N-gon has size at least logarithmic in N.
Abstract
Given a polytope P in , we say that P has a positive semidefinite lift (psd lift) of size d if one can express P as the linear projection of an affine slice of the positive semidefinite cone . If a polytope P has symmetry, we can consider equivariant psd lifts, i.e. those psd lifts that respect the symmetry of P. One of the simplest families of polytopes with interesting symmetries are regular polygons in the plane, which have played an important role in the study of linear programming lifts (or extended formulations). In this paper we study equivariant psd lifts of regular polygons. We first show that the standard Lasserre/sum-of-squares hierarchy for the regular N-gon requires exactly ceil(N/4) iterations and thus yields an equivariant psd lift of size linear in N. In contrast we show that one can construct an equivariant psd lift of the regular 2^n-gon…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
