Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
From MaRDI portal
Publication:517310
DOI10.1007/s10107-016-1043-1zbMath1358.90092arXiv1411.6867OpenAlexW2101538582MaRDI QIDQ517310
Etienne de Klerk, Monique Laurent, Zhao Sun
Publication date: 23 March 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6867
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Algebraic Perspectives on Signomial Optimization, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, 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, Distributionally robust optimization with polynomial densities: theory, models and algorithms, Quadrature-based polynomial optimization, Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Harmonic Hierarchies for Polynomial Optimization, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Connecting optimization with spectral analysis of tri-diagonal matrices, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization, Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A refined error analysis for fixed-degree polynomial optimization over the simplex
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- On the complexity of optimization over the standard simplex
- Triangulations. Structures for algorithms and applications
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- Certifying convergence of Lasserre's hierarchy via flat truncation
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Global Optimization with Polynomials and the Problem of Moments
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- On the Complexity of Computing the Volume of a Polyhedron
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Solving a class of multivariate integration problems via Laplace techniques
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
- Scattered Data Approximation
