A Refined Error Analysis for Fixed-Degree Polynomial Optimization over the Simplex
Author:
- 11 September 2014
- journal article
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 2 (3) , 379-393
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplexMathematical Programming, 2014
- Rounding on the standard simplex: regular grids for global optimizationJournal of Global Optimization, 2013
- On the accuracy of uniform polyhedral approximations of the copositive coneOptimization Methods and Software, 2012
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the HypercubeSIAM Journal on Optimization, 2010
- On the complexity of optimization over the standard simplexEuropean Journal of Operational Research, 2008
- The complexity of optimizing over a simplex, hypercube or sphere: a short surveyCentral European Journal of Operations Research, 2007
- Computing the Stability Number of a Graph Via Linear and Semidefinite ProgrammingSIAM Journal on Optimization, 2007
- A PTAS for the minimization of polynomials of fixed degree over the simplexTheoretical Computer Science, 2006
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002