Sums of Separable and Quadratic Polynomials

by   Amir Ali Ahmadi, et al.

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic polynomials are sums of squares, we study whether nonnegative SPQ polynomials are (i) the sum of a nonnegative separable and a nonnegative quadratic polynomial, and (ii) a sum of squares. We establish that the answer to question (i) is positive for univariate plus quadratic polynomials and for convex SPQ polynomials, but negative already for bivariate quartic SPQ polynomials. We use our decomposition result for convex SPQ polynomials to show that convex SPQ polynomial optimization problems can be solved by "small" semidefinite programs. For question (ii), we provide a complete characterization of the answer based on the degree and the number of variables of the SPQ polynomial. We also prove that testing nonnegativity of SPQ polynomials is NP-hard when the degree is at least four. We end by presenting applications of SPQ polynomials to upper bounding sparsity of solutions to linear programs, polynomial regression problems in statistics, and a generalization of Newton's method which incorporates separable higher-order derivative information.


Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

Pourchet proved in 1971 that every nonnegative univariate polynomial wit...

Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming

The problem of optimizing over the cone of nonnegative polynomials is a ...

Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials

Various key problems from theoretical computer science can be expressed ...

Finding polynomial roots by dynamical systems – a case study

We investigate two well known dynamical systems that are designed to fin...

Geometry of 3D Environments and Sum of Squares Polynomials

Motivated by applications in robotics and computer vision, we study prob...

Low-Rank Univariate Sum of Squares Has No Spurious Local Minima

We study the problem of decomposing a polynomial p into a sum of r squar...

Engineering and Business Applications of Sum of Squares Polynomials

Optimizing over the cone of nonnegative polynomials, and its dual counte...

Please sign up or login with your details

Forgot password? Click here to reset