Sum-of-Squares Framework for Optimization

• The Sum-of-Squares Framework is a method to certify nonnegativity of real polynomials by expressing them as sums of squared polynomials.
• It leverages algebraic tools like Gram matrix equivalence and pruning techniques (Newton polytope and zero-diagonal methods) to reduce computational complexity.
• By streamlining SDP formulations, the framework improves performance in polynomial optimization, robust control, and system verification applications.

A sum-of-squares (SOS) framework refers to the computational and mathematical apparatus that certifies the nonnegativity of real polynomials by expressing them as sums of squared polynomials, and translates this algebraic property into efficiently solvable semidefinite programming formulations. This framework is foundational in polynomial optimization, control, robust estimation, and many areas where nonnegativity of polynomials under constraints must be certified or exploited.

1. Algebraic Foundations and Gram Matrix Equivalence

Let $x=(x_1,\ldots,x_n)^T$ and consider a real polynomial

$$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$

$p$ is a sum of squares (SOS) if

$$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$

SOS implies $p(x)\ge 0$ for all $x$, but the converse fails outside special cases (e.g., Hilbert's 17th problem). For $p$ of degree $2d$, collect all monomials of degree $\le d$ into a vector $z(x)$ of length $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$0. Each $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$1, $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$2. The Gram-matrix theorem states:

$$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$3

if and only if $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$4 is SOS. Equating coefficients yields a system of linear equations $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$5, with the positive semidefiniteness constraint $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$6, defining a linear matrix inequality (LMI) feasibility problem (Seiler et al., 2013).

2. Monomial Basis Pruning: Newton Polytope and Zero-Diagonal Algorithms

The computational tractability of SOS programs depends crucially on pruning unnecessary monomials from $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$7.

Newton Polytope Pruning:

Define the Newton polytope $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$8. The reduced polytope is $$p(x) = \sum_{\alpha \in \mathcal{A}} c_\alpha x^\alpha, \qquad c_\alpha \in \mathbb{R},\ \mathcal{A}\subset\mathbb{N}^n \text{ finite}.$$9. Reznick's theorem guarantees that only monomials $p$0 with $p$1 can appear in any SOS decomposition. The pruning algorithm:

1. Construct $p$2 for all monomials up to degree $p$3.
2. Compute $p$4, obtain its half-space representation $p$5.
3. Discard $p$6 from $p$7 if $p$8 fails.

However, computing the convex hull $p$9 is $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$0, which is prohibitive for large $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$1 (Seiler et al., 2013).

Zero-Diagonal (PSD Property) Pruning:

If $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$2 and $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$3, then row and column $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$4 of $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$5 are zero, so $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$6 can be removed. The iterative algorithm alternates between checking for equations $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$7 (from the linear system reflecting $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$8) and removing the corresponding monomials/rows/columns from further consideration. This method produces a pruned monomial set $$p(x) = \sum_{i=1}^m f_i(x)^2, \quad f_i\in\mathbb{R}[x].$$9, and can yield strict reductions. For example, $p(x)\ge 0$0 leads Newton polytope pruning to keep 4 monomials, while zero-diagonal pruning reduces this to 3 (Seiler et al., 2013). Complexity is $p(x)\ge 0$1, much faster than Newton polytope convex-hull construction in high dimensions.

3. Generalization to SOS Programming in Polynomial Optimization

An SOS program has the form:

$p(x)\ge 0$2

where $p(x)\ge 0$3 is affine in $p(x)\ge 0$4, and $p(x)\ge 0$5 denotes the cone of SOS polynomials. Each constraint introduces a Gram matrix $p(x)\ge 0$6 and a reduced monomial basis via the zero-diagonal or Newton polytope pruning procedures. The aggregate system is encoded as an SDP in the concatenated variable $p(x)\ge 0$7 subject to feasibility $p(x)\ge 0$8, with $p(x)\ge 0$9.

The iterative pruning approach can be extended to automatically eliminate unnecessary monomials and even free variables $x$0 that are forced to zero (Seiler et al., 2013).

Performance experiments show monomial reductions up to 50%, reductions in free scalar variables by 10–20%, and total solver time reductions of 30–70% on benchmark SOS programs, with improved numerical stability.

4. Algorithmic and Numerical Impact

Reducing the monomial basis shrinks Gram matrices $x$1, resulting in smaller SDP blocks and fewer decision variables—directly lowering both memory and computational burden. Preprocessing scales as $x$2 per constraint for the zero-diagonal method, compared to exponential scaling in $x$3 for Newton polytope convex-hull methods.

Automatic detection and elimination of zero-valued variables or monomials enhances problem conditioning and can prevent solver warnings or numerical issues (Seiler et al., 2013). Implementations are available in prominent software toolboxes such as SOSOPT and SOSTOOLS, enabling practical solution of high-dimensional or higher-degree problems in systems analysis, control, and polynomial optimization.

5. Integration and Practical Toolbox Implementation

The described simplification and pruning techniques are integral to modern SOS optimization toolchains. They underpin the ability to solve SDPs arising from SOS relaxations of polynomial optimization problems, particularly in higher dimensions or with higher-degree polynomials, where brute-force enumeration of all monomials becomes computationally infeasible.

Toolboxes such as SOSOPT and SOSTOOLS provide options to invoke these simplification procedures automatically. Their adoption has been critical in making SOS approaches tractable for practitioners in robust control, system verification, and nonconvex polynomial optimization (Seiler et al., 2013).

---

The sum-of-squares framework thus consists of a hierarchy of certificate-construction and basis-reduction methods, all ultimately aiming to encode the existence of an SOS decomposition as a tractable SDP or LMI, and supporting this transformation with scalable preprocessing algorithms that exploit polyhedral and algebraic structure to minimize computational overhead (Seiler et al., 2013).