The moment-SOS hierarchy: applications and related topics
From MaRDI portal
Publication:6598421
DOI10.1017/s0962492923000053zbMATH Open1546.65043MaRDI QIDQ6598421
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
- Pell's equation, sum-of-squares and equilibrium measures on a compact set
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Synergies Between Operations Research and Quantum Information Science
- Exploiting constant trace property in large-scale polynomial optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Handbook on semidefinite, conic and polynomial optimization
- Semidefinite programming for min-max problems and games
- Sum of squares method for sensor network localization
- On the complexity of Schmüdgen's Positivstellensatz
- Géza Freud, orthogonal polynomials and Christoffel functions. A case study
- Representing polynomials by positive linear functions on compact convex polyhedra
- The \(K\)-moment problem for compact semi-algebraic sets
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Semidefinite programming relaxations for semialgebraic problems
- Tensor eigenvalue complementarity problems
- Positive polynomials in control.
- Sparsity in sums of squares of polynomials
- Bounds on measures satisfying moment conditions.
- Bounds for projective codes from semidefinite programming
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- Semi-algebraic approximation using Christoffel-Darboux kernel
- A disintegration of the Christoffel function
- \(k\)-point semidefinite programming bounds for equiangular lines
- Graph recovery from incomplete moment information
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- Connecting optimization with spectral analysis of tri-diagonal matrices
- Anneaux preordonnes
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
- Semidefinite programming relaxations and algebraic optimization in control
- New dense superball packings in three dimensions
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Convex generalized Nash equilibrium problems and polynomial optimization
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Exploiting sparsity for semi-algebraic set volume computation
- Global optimization with polynomials and the problem of moments
- SDP Relaxations for Non-Commutative Polynomial Optimization
- Optimization of Polynomials in Non-Commuting Variables
- The $\mathbf {K}$-moment problem for continuous linear functionals
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- New upper bounds for kissing numbers from semidefinite programming
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Approximate Volume and Integration for Basic Semialgebraic Sets
- The Complex Equilibrium Measure of a Symmetric Convex Set in R n
- On the Complexity of Computing the Volume of a Polyhedron
- Accurate and Efficient Reconstruction of Discontinuous Functions from Truncated Series Expansions
- Complex Equilibrium Measure and Bernstein Type Theorems for Compact Sets in R n
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Sum-of-squares proofs and the quest toward optimal algorithms
- Low Rank Symmetric Tensor Approximations
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- SOS Is Not Obviously Automatizable, Even Approximately
- Convex Duality and Nonlinear Optimal Control
- Optimisation globale et théorie des moments
- The Moment Problem
- The Moment-SOS Hierarchy
- Scalable Semidefinite Programming
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Sparse Polynomial Optimization
- Localization With One-Bit Passive Radars in Narrowband Internet-of-Things Using Multivariate Polynomial Optimization
- A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
- Hermitian Tensor Decompositions
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The Christoffel-Darboux Kernel
- Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization
- 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
- The Christoffel–Darboux Kernel for Data Analysis
- A hierarchy of spectral relaxations for polynomial optimization
- Playing unique games on certified small-set expanders
- Moment and Polynomial Optimization
This page was built for publication: The moment-SOS hierarchy: applications and related topics