Approximating Nonnegative Polynomials via Spectral Sparsification

Abstract

We study polyhedral approximations to the cone of nonnegative polynomials. We show that any constant ratio polyhedral approximation to the cone of nonnegative degree $2d$ forms in $n$ variables has to have exponentially many facets in terms of $n$. We also showthat for fixed $m\ge 3$, all linear $m$ dimensional sections of the nonnegative cone that include $(x_1^2+x_2^2+\dots +x_n^2{)}^d$ has a costant ratio polyhedral approximation with $O(n^{m-2})$ many facets. Our approach is convex geometric, and parts of the argument rely on the recent solution of Kadison-Singer problem. We also discuss a randomized polyhedral approximation which might be of independent interest.

arXiv commentRevision incorporating referee comments and new random approximation results

Cited by in corpus (1)

• Harmonic Hierarchies for Polynomial Optimization