Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
From MaRDI portal
(Redirected from Publication:3083323)
Recommendations
- scientific article; zbMATH DE number 7305739
- Error bounds for polynomial optimization over the hypercube using Putinar type representations
- Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube
- Sum-of-squares hierarchies for binary polynomial optimization
- A PTAS for the minimization of polynomials of fixed degree over the simplex
Cited in
(31)- A note on total degree polynomial optimization by Chebyshev grids
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Rank of Handelman hierarchy for Max-Cut
- Handelman's hierarchy for the maximum stable set problem
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
- 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
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- A version of Putinar's Positivstellensatz for cylinders
- Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube
- scientific article; zbMATH DE number 7305739 (Why is no real title available?)
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- 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
- LP formulations for polynomial optimization problems
- 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
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
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)
