An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
From MaRDI portal
Publication:384182
DOI10.1007/S40305-013-0017-8zbMATH Open1277.90157OpenAlexW2017436952MaRDI QIDQ384182FDOQ384182
Authors: Jiawang Nie 
Publication date: 27 November 2013
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-013-0017-8
Recommendations
- Approximation bound analysis based on the tight constraints polynomial optimization problems of Lasserre relaxation
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- Optimization of Polynomial Functions
Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Global optimization with polynomials and the problem of moments
- Semidefinite programming relaxations for semialgebraic problems
- Minimizing polynomials via sum of squares over the gradient ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On the complexity of Putinar's Positivstellensatz
- Quadratic programming with one negative eigenvalue is NP-hard
- Title not available (Why is that?)
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
Cited In (9)
- Approximation bound analysis based on the tight constraints polynomial optimization problems of Lasserre relaxation
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Border basis relaxation for polynomial optimization
- Lower bound functions for polynomials
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
This page was built for publication: An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384182)
