An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
From MaRDI portal
(Redirected from Publication:384182)
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
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Minimizing polynomials via sum of squares over the gradient ideal
- On the complexity of Putinar's Positivstellensatz
- Quadratic programming with one negative eigenvalue is NP-hard
- Semidefinite programming relaxations for semialgebraic problems
Cited in
(9)- Lower bound functions for polynomials
- 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
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Border basis relaxation for polynomial optimization
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
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)
