---
title: Moment–SOS Hierarchy Overview
url: https://www.emergentmind.com/topics/moment-sos-hierarchy-c8ff7a36-f04d-40ac-aae8-cbcf80f0c885
type: topic
---

# Moment–SOS Hierarchy Overview

The moment–sum-of-squares (SOS) hierarchy, often called the Lasserre hierarchy, is a foundational methodology in polynomial optimization, polynomial matrix optimization, and generalized moment problems. It provides a systematic, convex relaxation framework for approximating infima of polynomials under semialgebraic constraints and supports a wide array of extensions to complex, infinite-dimensional, matrix-valued, robust, and sparse settings. The essential mechanism is the duality between representing a sequence as moments of a measure and certifying nonnegativity via sum-of-squares polynomials, realized via a hierarchy of semidefinite programs (SDPs) whose solutions exhibit strong convergence theorems, finite convergence under structural conditions, and a variety of practical computational relaxations.

## 1. Foundational Principles and Duality

The classical moment–SOS hierarchy addresses the polynomial optimization problem (POP)
$$
f^* = \inf_{x \in K} f(x), \quad K = \{ x \in \mathbb{R}^n : g_j(x) \ge 0, \, j = 1, \dots, m \}
$$
by casting it as a generalized moment problem (GMP), seeking a representing measure $\mu$ whose moments $y_\alpha = \int_K x^\alpha d\mu(x)$ satisfy certain positivity constraints [1808.03446], [2011.08139].

This approach is dual to the sum-of-squares (SOS) certificate of nonnegativity. Under an Archimedean quadratic module (i.e., with $R - \|x\|^2 \in Q(g)$ for some $R$), any polynomial strictly positive on $K$ admits a decomposition
$$
f(x) - \lambda = \sigma_0(x) + \sum_j \sigma_j(x) g_j(x), \quad \sigma_j \in \mathrm{SOS}
$$
with degree bounds determined by the order of relaxation [1808.03446]. The corresponding moment SDP imposes positive semidefiniteness (PSD) on the (truncated) moment matrix $M_d(y)$ and weighted (localizing) matrices $M_{d-d_j}(g_j y)$, yielding a monotone sequence of relaxations whose optimal values converge to $f^*$ as $d \to \infty$ under the Putinar-Archimedean condition [2011.08139], [2507.00572], [2402.00436].

The dual–primal relationship extends to a large class of GMPs, such as measure-projected LPs, volume, optimal control, and nonlinear PDEs [2011.08139], [2305.18768], [2412.07361].

## 2. Structure of the Hierarchy: Primal and Dual SDPs

At each order $d$, the primal (moment) SDP uses the truncated moment sequence $(y_\alpha)_{|\alpha| \le 2d}$:
- The moment matrix $M_d(y)$ collects $(y_{\alpha + \beta})$ for $|\alpha|, |\beta| \le d$.
- For each constraint $g_j$, the localizing matrix $M_{d - d_j}(g_j y)$ imposes PSD constraints reflecting measure support on $K$.

The SDP formulation (primal side) is:
$$
\begin{aligned}
\min_y \; &L_y(f) \\
\text{subject to} \;
& y_0 = 1, \\
& M_d(y) \succeq 0, \\
& M_{d-d_j}(g_j y) \succeq 0 \;\; (j=1,\dots,m).
\end{aligned}
$$
The dual (SOS) SDP seeks sum-of-squares representations:
$$
\begin{aligned}
\max_{t, \{\sigma_j\}} \quad & t \\
\text{subject to} \;
& f(x) - t = \sigma_0(x) + \sum_{j=1}^m \sigma_j(x) g_j(x) \\
& \deg(\sigma_j g_j) \le 2d.
\end{aligned}
$$
Strong duality holds under interiority and compactness conditions [2011.08139], [1808.03446].

These constructions extend to generalized moment problems with additional moment constraints and to cases where positivity must be enforced on noncompact sets using regularization and Carleman conditions [2512.05612].

## 3. Convergence, Flat Extension, and Finite Convergence

If the quadratic module is Archimedean, convergence of the SDP hierarchy is guaranteed:
$$
p_d \uparrow f^*, \qquad \lim_{d \to \infty} p_d = f^*
$$
where $p_d$ is the optimal value at relaxation order $d$ [2011.08139]. Under flat extension, i.e., when
$$
\mathrm{rank} \, M_d(y^*) = \mathrm{rank} \, M_{d - \delta}(y^*) \text{ for some } d,
$$
finite convergence is certified and global minimizers can be extracted via linear algebraic procedures (multiplication matrices, joint diagonalization) [2304.12628], [2403.17241].

Finite convergence also occurs whenever the problem exhibits hidden strong convexity or SOS-convexity, with explicit degree thresholds provided by Putinar-type matrix positivity certificates [2603.00284]. In matrix polynomial optimization, the nondegeneracy, strict complementarity, and second-order sufficient conditions at all minimizers guarantee finite convergence and eventual flatness of moments [2403.17241].

## 4. Extensions: Matrix, Robust, Sparse, Infinite-dimensional, and Regularized Hierarchies

The hierarchy generalizes to:
- **Polynomial matrix inequalities (PMIs):** Problems with robust or uncertain matrix constraints, including uncertainty sets defined via PMIs, are treated by introducing matrix-valued moment and localizing matrices, with PSD-SOS-convexity yielding strong duality, convergence, and flat extension results [2304.12628], [2403.17241]. Extraction of finitely-atomic matrix-valued measures and global minimizers proceeds analogously to the scalar case.
- **Robust and eigenvalue minimization:** Applications to robust semidefinite programs and eigenvalue minimization of polynomial matrices are handled with the same architecture [2304.12628].
- **Complex polynomials and Hermitian-SOS:** The real moment-HSOS hierarchy matches the lower bounds of the complex version for real-data, achieves speedup via halved matrix sizes, and admits tight rank-detection criteria for global optimality under sphere constraints [2308.14631].
- **Infinite-dimensional problems:** The moment–SOS framework extends to evolution PDEs in Hilbert or distribution spaces, reformulated as measure-valued Liouville equations. Discretizing cylindrical polynomials and moments yields SDP relaxations whose solutions converge to the true measure-valued dynamics, with global convergence under dissipativity [2412.07361], [2305.18768].
- **Unbounded domains and non-Archimedean sets:** Regularized versions of the hierarchy employ Carleman-determinacy and L²-density results, providing strong convergence even without compactness or Positivstellensatz, and yield monotonic certified lower bounds after suitable penalization [2512.05612].

## 5. Algorithmic Enhancements: Exploiting Sparsity and Scalability

Computational demands motivate scalable variants exploiting problem structure:
- **Term sparsity and block decompositions:** The TSSOS framework and its variants (block, chordal, CS-TSSOS, refined TSSOS) utilize monomial adjacency graphs to decompose large moment/localizing matrices into block-diagonal form [1912.08899], [2003.03210], [2005.02828], [2402.05444]. Support–extension and chordal–extension procedures iteratively build block structures, often drastically reducing computational cost without sacrificing tightness. Refined block-splitting algorithms further optimize block size using combinatorial optimization [2402.05444].
- **Sublevel and interpolatory hierarchies:** The sublevel Moment–SOS hierarchy interpolates between consecutive orders by selectively enlarging matrix blocks (“levels” and “depths”). Fine-tuning these hyperparameters balances bound quality and memory footprint, yielding practical improvements in applications such as Max-Cut and neural network verification [2101.05167].
- **Dual sparsity (correlative + term):** The CS-TSSOS hierarchy marries correlative (variable) and term (monomial) sparsity to achieve two-level block-diagonal SDPs with strong convergence and demonstrable tractability for problems with thousands of variables [2005.02828].

## 6. Quantitative Convergence Rates, Complexity, and Generic Finite Convergence

Recent advances provide explicit convergence rates and complexity bounds:
- **Convergence rates:** The hierarchy achieves rates $O(1/r^L)$ where $L$ is the Lojasiewicz exponent of the set, with $O(1/r^2)$ possible in highly regular domains (ball, simplex, sphere), $O(1/r)$ for polytopes, and $O(1/\sqrt{r})$ under strong convexity [2507.00572], [2402.00436].
- **Bit complexity:** Although the SDP at fixed order has polynomial size in $n$, the worst-case bit complexity may be exponential (as shown for certain combinatorial and univariate instances). However, under geometric (interior ball) or spectral-gap conditions, polynomial-time solvability at each order is guaranteed [2305.14944].
- **Finite convergence “in practice”:** Generic finite convergence, ensured for generic $f$ under the Archimedean property, can be detected by monitoring flatness of the moment matrix [2011.08566].

## 7. The Christoffel–Darboux Interpretation and Extraction of Minimizers

Each moment–SOS relaxation may be viewed as constructing a polynomial density in $L^2$ over the feasible set, with the optimal density being the Christoffel–Darboux kernel associated to the global minimizer. This reproducing kernel perspective underlies the extraction of minimizers as solutions to systems involving orthonormal polynomials, and relates the density maximization principle to Dirac-like measure recovery [2011.08566].

At exactness, the Christoffel function is sharply peaked at the minimizer and inverse Christoffel values are diagnostic of optimality.

---

The moment–SOS hierarchy is thus a comprehensive mathematical and algorithmic construction for global polynomial optimization, semidefinite generalized problems of moments, and their matrix-, infinite-dimensional-, and robust extensions. Central issues concerning convergence, extraction of solutions, computational complexity, and practical scalability have led to a rich body of methodologies and theoretical guarantees within this paradigm [1808.03446], [2507.00572], [2011.08139], [2304.12628], [2603.00284], [2403.17241].

Source: https://www.emergentmind.com/topics/moment-sos-hierarchy-c8ff7a36-f04d-40ac-aae8-cbcf80f0c885