An effective version of Schmüdgen's Positivstellensatz for the hypercube

DOI10.1007/s11590-022-01922-5OpenAlexW3199796140MaRDI QIDQ2693779

Monique Laurent, Lucas Slot

Publication date: 24 March 2023

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programmingSchmüdgen's PositivstellensatzLasserre hierarchysum-of-squares polynomialsJackson kernelpolynomial kernel method

Mathematics Subject Classification ID

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

Related Items

Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, On the effective Putinar's Positivstellensatz and moment approximation, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, Degree Bounds for Putinar’s Positivstellensatz on the Hypercube

Cites Work

• Unnamed Item
• An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
• Optimality conditions and finite convergence of Lasserre's hierarchy
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• The \(K\)-moment problem for compact semi-algebraic sets
• Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
• On the complexity of Putinar-Vasilescu's Positivstellensatz
• The sum-of-squares hierarchy on the sphere and applications in quantum information theory
• Error bounds for polynomial optimization over the hypercube using Putinar type representations
• Complexity estimates for the Schmüdgen Positivstellensatz
• 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
• Polynomials that are positive on an interval
• Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.