Paper detail

On sums of squares of $k$-nomials

In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing at most $k$ non-zeros. The cones of matrices of bounded factor width give a hierarchy of inner approximations to the PSD cone. In the polynomial optimization context, a Gram matrix of a polynomial having factor width $k$ corresponds to the polynomial being a sum of squares of polynomials of support at most $k$. Recently, Ahmadi and Majumdar, explored this connection for case $k=2$ and proposed to relax the reliance on sum of squares polynomials in semidefinite programming to sum of binomial squares polynomials (sobs; which they call sdsos), for which semidefinite programming can be reduced to second order programming to gain scalability at the cost of some tolerable loss of precision. With this they tap into the study of sobs that goes back to Reznick and Hurwitz. In this paper, we will prove some results on the geometry of the cones of matrices with bounded factor widths and their duals, and use them to derive new results on the limitations of certificates of nonnegativity of quadratic forms by sums of $k$-nomial squares using standard multipliers. In particular we will show that they never help for symmetric quadratics, for any quadratic if $k=2$, and any quaternary quadratic if $k=3$. Furthermore we give some evidence that those are a complete list of such cases.