The moment-SOS hierarchy: applications and related topics

DOI10.1017/S0962492923000053zbMATH Open1546.65043MaRDI QIDQ6598421FDOQ6598421

Publication date: 5 September 2024

Published in: Acta Numerica (Search for Journal in Brave)

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Polynomial optimization (90C23)

Cites Work

Localization With One-Bit Passive Radars in Narrowband Internet-of-Things Using Multivariate Polynomial Optimization
Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
Synergies Between Operations Research and Quantum Information Science
CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
Exploiting constant trace property in large-scale polynomial optimization
Global optimization with polynomials and the problem of moments
Title not available (Why is that?)
Representing polynomials by positive linear functions on compact convex polyhedra
The \(K\)-moment problem for compact semi-algebraic sets
Semidefinite programming relaxations for semialgebraic problems
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
Sums of squares, moment matrices and optimization over polynomials
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Sum-of-squares proofs and the quest toward optimal algorithms
Convex computation of the maximum controlled invariant set for polynomial control systems
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Semidefinite Programming vs. LP Relaxations for Polynomial Programming
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Anneaux preordonnes
Optimality conditions and finite convergence of Lasserre's hierarchy
Positive polynomials and sums of squares
Sum of squares method for sensor network localization
Title not available (Why is that?)
On the Complexity of Computing the Volume of a Polyhedron
Géza Freud, orthogonal polynomials and Christoffel functions. A case study
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
Bounds on measures satisfying moment conditions.
PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
The Christoffel-Darboux Kernel
Handbook on semidefinite, conic and polynomial optimization
On the complexity of Schmüdgen's Positivstellensatz
Positive polynomials in control.
Bounds for projective codes from semidefinite programming
An introduction to polynomial and semi-algebraic optimization
New upper bounds for kissing numbers from semidefinite programming
Title not available (Why is that?)
Sparsity in sums of squares of polynomials
Title not available (Why is that?)
Title not available (Why is that?)
Tensor eigenvalue complementarity problems
Convex Duality and Nonlinear Optimal Control
Certifying convergence of Lasserre's hierarchy via flat truncation
Approximate volume and integration for basic semialgebraic sets
Convexity in SemiAlgebraic Geometry and Polynomial Optimization
Accurate and Efficient Reconstruction of Discontinuous Functions from Truncated Series Expansions
Optimisation globale et théorie des moments
On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
Complex Equilibrium Measure and Bernstein Type Theorems for Compact Sets in R n
Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
A moment approach for entropy solutions to nonlinear hyperbolic PDEs
Semidefinite programming relaxations and algebraic optimization in control
The Complex Equilibrium Measure of a Symmetric Convex Set in R n
Semidefinite programming for min-max problems and games
Lasserre hierarchy for large scale polynomial optimization in real and complex variables
Title not available (Why is that?)
The \(K\)-moment problem for continuous linear functionals
Title not available (Why is that?)
Optimization of polynomials in non-commuting variables
SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
The moment problem
Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
An effective version of Schmüdgen's Positivstellensatz for the hypercube
A hierarchy of spectral relaxations for polynomial optimization
SDP relaxations for non-commutative polynomial optimization
SOS is not obviously automatizable, even approximately
Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
The sum-of-squares hierarchy on the sphere and applications in quantum information theory
Semi-algebraic approximation using Christoffel-Darboux kernel
Exploiting sparsity for semi-algebraic set volume computation
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Low rank symmetric tensor approximations
A disintegration of the Christoffel function
Scalable semidefinite programming
The Christoffel-Darboux kernel for data analysis
HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
Hermitian tensor decompositions
\(k\)-point semidefinite programming bounds for equiangular lines
Moment methods in energy minimization: new bounds for Riesz minimal energy problems
Graph recovery from incomplete moment information
Computing Gaussian \& exponential measures of semi-algebraic sets
Sparse Polynomial Optimization
A new sparse SOS decomposition algorithm based on term sparsity
Connecting optimization with spectral analysis of tri-diagonal matrices
New dense superball packings in three dimensions
Hardness of approximation
Stokes, Gibbs, and volume computation of semi-algebraic sets
Convex generalized Nash equilibrium problems and polynomial optimization
Playing unique games on certified small-set expanders
Pell's equation, sum-of-squares and equilibrium measures on a compact set
Moment and Polynomial Optimization

This page was built for publication: The moment-SOS hierarchy: applications and related topics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598421)