On the convergence rate of grid search for polynomial optimization over the simplex
- 7 March 2016
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 11 (3) , 597-608
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric DistributionSIAM Journal on Optimization, 2015
- 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
- A PTAS for the minimization of polynomials of fixed degree over the simplexTheoretical Computer Science, 2006
- Convex Optimization2004
- Global Optimization of Homogeneous Polynomials on the Simplex and on the Sphere2004
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002
- Bounding the Lebesgue function for Lagrange interpolation in a simplexJournal of Approximation Theory, 1983
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980