Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
From MaRDI portal
Publication:2144552
DOI10.1007/s10107-020-01468-3zbMath1494.90074arXiv1905.08142OpenAlexW3101637132MaRDI QIDQ2144552
Publication date: 14 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.08142
semidefinite programmingpolynomial optimizationLasserre hierarchyneedle polynomialsum-of-squares polynomial
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Polynomial optimization (90C23)
Related Items
Algebraic Perspectives on Signomial Optimization, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, Homogenization for polynomial optimization with unbounded sets, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Sum-of-squares hierarchies for binary polynomial optimization, Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization, Sum-of-squares hierarchies for binary polynomial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multivariate ``needle polynomials with application to norming sets and cubature formulas
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Convex analysis and nonlinear optimization. Theory and examples.
- Curvature and \(q\)-strict convexity
- Cutting corners always works
- On density of interpolation points, a Kadec-type theorem, and Saff's principle of contamination in \(L_ p\)-approximation
- The empirical Christoffel function with applications in data analysis
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- Quadrature-based polynomial optimization
- On Blaschke's rolling theorems
- Approximation of the Stability Number of a Graph via Copositive Programming
- 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
- Strict convexity of sets in analytic terms
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Christoffel Functions and Universality in the Bulk for Multivariate Orthogonal Polynomials
- 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
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Orthogonal Polynomials of Several Variables
