Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
From MaRDI portal
Publication:6176427
DOI10.1137/22m1540818zbMath1522.14072arXiv2211.04889OpenAlexW4312092748MaRDI QIDQ6176427
Publication date: 23 August 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.04889
Semidefinite programming (90C22) Sums of squares and representations by other particular quadratic forms (11E25) Real algebraic sets (14P05)
Related Items
Second Order Conditions to Decompose Smooth Functions as Sums of Squares, Degree Bounds for Putinar’s Positivstellensatz on the Hypercube
Cites Work
- 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
- On the complexity of Schmüdgen's Positivstellensatz
- Semidefinite programming relaxations for semialgebraic problems
- A Taylor expansion of the square root matrix function
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- A polarization identity for multilinear maps
- Sums of squares on real algebraic surfaces
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Global Optimization with Polynomials and the Problem of Moments
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- An Interior-Point Method for Semidefinite Programming
- The Moment Problem
- The Moment-SOS Hierarchy
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Positive trigonometric polynomials and signal processing applications
- Sum-of-squares hierarchies for binary polynomial optimization
- On the effective Putinar's Positivstellensatz and moment approximation
