Sparse sums of squares on finite abelian groups and improved semidefinite lifts
Name
10107_2015_977_ReferencePDF.pdf
Size
721.66 KB
Format
Adobe PDF
Checksum (MD5)
24187dcffd41cd7d6de109321c4efe68
Author(s)
Fawzi, Hamza
Saunderson, James F
Parrilo, Pablo A
Date Issued
January 2016
Journal
Mathematical Programming
Publisher
Springer Berlin Heidelberg
Citation
Fawzi, Hamza, James Saunderson, and Pablo A. Parrilo. “Sparse Sums of Squares on Finite Abelian Groups and Improved Semidefinite Lifts.” Mathematical Programming 160, no. 1–2 (January 27, 2016): 149–191.
Version
Author's final manuscript
Abstract
Let G be a finite abelian group. This paper is concerned with nonnegative functions on G that are sparse with respect to the Fourier basis. We establish combinatorial conditions on subsets S and T of Fourier basis elements under which nonnegative functions with Fourier support S are sums of squares of functions with Fourier support T. Our combinatorial condition involves constructing a chordal cover of a graph related to G and S (the Cayley graph Cay(G^,S)) with maximal cliques related to T. Our result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern, as well as a simple but key observation exploiting the structure of the Fourier basis elements of G (the characters of G). We apply our general result to two examples. First, in the case where G=Zn2, by constructing a particular chordal cover of the half-cube graph, we prove that any nonnegative quadratic form in n binary variables is a sum of squares of functions of degree at most ⌈n/2⌉, establishing a conjecture of Laurent. Second, we consider nonnegative functions of degree d on ZN (when d divides N). By constructing a particular chordal cover of the dth power of the N-cycle, we prove that any such function is a sum of squares of functions with at most 3dlog(N/d) nonzero Fourier coefficients. Dually this shows that a certain cyclic polytope in R2d with N vertices can be expressed as a projection of a section of the cone of positive semidefinite matrices of size 3dlog(N/d). Putting N=d2 gives a family of polytopes in R2d with linear programming extension complexity Ω(d2) and semidefinite programming extension complexity O(dlog(d)). To the best of our knowledge, this is the first explicit family of polytopes (Pd) in increasing dimensions where xcPSD(Pd)=o(xcLP(Pd)), where xcPSD and xcLP are respectively the SDP and LP extension complexity.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10107-015-0977-z
