Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel

DOI10.1137/21M1458338OpenAlexW3211832094MaRDI QIDQ5051374

Lucas Slot

Publication date: 23 November 2022

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.04610

zbMATH Keywords

PositivstellensatzChristoffel-Darboux kernelpolynomial optimizationsum-of-squares hierarchypolynomial kernel method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Polynomial optimization (90C23)

Related Items (3)

Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023 ⋮ Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials ⋮ Degree Bounds for Putinar’s Positivstellensatz on the Hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse sums of squares on finite abelian groups and improved semidefinite lifts
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• Dual optimal design and the Christoffel-Darboux polynomial
• The empirical Christoffel function with applications in data analysis
• Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
• The moment-SOS hierarchy and the Christoffel-Darboux kernel
• Semi-algebraic approximation using Christoffel-Darboux kernel
• Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
• Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
• Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
• On the complexity of Putinar-Vasilescu's Positivstellensatz
• The sum-of-squares hierarchy on the sphere and applications in quantum information theory
• Data analysis from empirical moments and the Christoffel function
• An effective version of Schmüdgen's Positivstellensatz for the hypercube
• Global Optimization with Polynomials and the Problem of Moments
• Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
• The kernel polynomial method
• Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
• Summability of Fourier orthogonal series for Jacobi weight functions on the simplex in ℝ^{𝕕}
• Summability of Fourier orthogonal series for Jacobi weight on a ball in ℝ^{𝕕}
• Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
• Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
• Sum-of-squares hierarchies for binary polynomial optimization
• On the effective Putinar's Positivstellensatz and moment approximation

This page was built for publication: Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel