A refined error analysis for fixed-degree polynomial optimization over the simplex
From MaRDI portal
Publication:489141
DOI10.1007/s40305-014-0057-8zbMath1308.90172arXiv1312.5873OpenAlexW2128643477MaRDI QIDQ489141
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5873
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items (2)
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization ⋮ An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
Cites Work
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- On the complexity of optimization over the standard simplex
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Semidefinite programming relaxations for semialgebraic problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Rounding on the standard simplex: regular grids for global optimization
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
This page was built for publication: A refined error analysis for fixed-degree polynomial optimization over the simplex
