Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
DOI10.1137/100790835zbMATH Open1229.90279OpenAlexW2112356323MaRDI QIDQ3083323FDOQ3083323
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100790835
semidefinite programmingpositive polynomialPositivstellensatzsum of squares of polynomialsmultivariate Bernstein approximationbound constrained optimization of polynomials
Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (28)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
- A note on total degree polynomial optimization by Chebyshev grids
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- Rank of Handelman hierarchy for Max-Cut
- Handelman's hierarchy for the maximum stable set problem
- LP Formulations for Polynomial Optimization Problems
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- A version of Putinar's Positivstellensatz for cylinders
- Title not available (Why is that?)
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- A few more extensions of Putinar's Positivstellensatz to non-compact sets
- Error bounds for polynomial optimization over the hypercube using Putinar type representations
- Degree Bounds for Putinar’s Positivstellensatz on the Hypercube
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz
- A refined error analysis for fixed-degree polynomial optimization over the simplex
- Error bounds for monomial convexification in polynomial optimization
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Inhomogeneous polynomial optimization over a convex set: An approximation approach
Uses Software
This page was built for publication: Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083323)
