A sum-of-squares optimization program is an optimization problem with a linear cost function and constraints that certain polynomials constructed from the decision variables should be sums of squares. When the maximum degree of the polynomials involved is fixed, sum-of-squares optimization is also known as the Lasserre hierarchy of semidefinite programming relaxations. Sum-of-squares optimization techniques have been applied across a variety of areas, including control theory (in particular, for searching for polynomial Lyapunov functions for dynamical systems described by polynomial vector fields), statistics, finance and machine learning.
Background
A polynomial p {\displaystyle p} is a sum of squares (SOS) if there exist polynomials { f i } i = 1 m {\displaystyle \{f_{i}\}_{i=1}^{m}} such that p = ∑ i = 1 m f i 2 {\textstyle p=\sum _{i=1}^{m}f_{i}^{2}} . For example,
p = x 2 − 4 x y + 7 y 2 {\displaystyle p=x^{2}-4xy+7y^{2}}
is a sum of squares since
p = f 1 2 + f 2 2 {\displaystyle p=f_{1}^{2}+f_{2}^{2}}
where
f 1 = ( x − 2 y ) and f 2 = 3 y . {\displaystyle f_{1}=(x-2y){\text{ and }}f_{2}={\sqrt {3}}y.}
Note that if p {\displaystyle p} is a sum of squares then p ( x ) ≥ 0 {\displaystyle p(x)\geq 0} for all x ∈ R n {\displaystyle x\in \mathbb {R} ^{n}} . Detailed descriptions of polynomial SOS are available. Quadratic forms can be expressed as p ( x ) = x T Q x {\displaystyle p(x)=x^{T}Qx} where Q {\displaystyle Q} is a symmetric matrix. Similarly, polynomials of degree ≤ 2d can be expressed as
p ( x ) = z ( x ) T Q z ( x ) , {\displaystyle p(x)=z(x)^{\mathsf {T}}Qz(x),}
where the vector z {\displaystyle z} contains all monomials of degree ≤ d {\displaystyle \leq d} . This is known as the Gram matrix form. An important fact is that p {\displaystyle p} is SOS if and only if there exists a symmetric and positive-semidefinite matrix Q {\displaystyle Q} such that p ( x ) = z ( x ) T Q z ( x ) {\displaystyle p(x)=z(x)^{\mathsf {T}}Qz(x)} . This provides a connection between SOS polynomials and positive-semidefinite matrices.
Optimization problem A sum-of-squares optimization problem is a conic optimization problem with respect to the cone of sum-of-squares polynomials. Concretely, given a vector c ∈ R n {\displaystyle c\in \mathbb {R} ^{n}} and polynomials a k , j {\displaystyle a_{k,j}} for k = 1 , … N s {\displaystyle k=1,\dots N_{s}} , j = 0 , 1 , … , n {\displaystyle j=0,1,\dots ,n} , a sum-of-squares optimization problem is written as
… excerpt ends here. Continue reading the full article.
