# On the convergence rate of grid search for polynomial optimization over the simplex

@article{Klerk2017OnTC,
title={On the convergence rate of grid search for polynomial optimization over the simplex},
author={Etienne de Klerk and Monique Laurent and Zhao Sun and Juan C. Vera},
journal={Optimization Letters},
year={2017},
volume={11},
pages={597-608}
}
• Published 5 October 2015
• Computer Science, Mathematics
• Optimization Letters
We consider the approximate minimization of a given polynomial on the standard simplex, obtained by taking the minimum value over all rational grid points with given denominator $${r} \in \mathbb {N}$$r∈N. It was shown in De Klerk et al. (SIAM J Optim 25(3):1498–1514, 2015) that the accuracy of this approximation depends on r as $$O(1/r^2)$$O(1/r2) if there exists a rational global minimizer. In this note we show that the rational minimizer condition is not necessary to obtain the $$O(1/r^2)$$O…
6 Citations
A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
• Mathematics, Computer Science
Association for Women in Mathematics Series
• 2019
This work will review some results on inner and inner conic approximations of the convex cone of positive Borel measures, with a special focus on the convergence rate of the hierarchies of upper and lower bounds for the general problem of moments that are obtained from these inner and outer approximation.
Global polynomial optimization by norming sets on sphere and torus
Using the approximation theoretic notion of norming set, we compute (1 − ε)-approximations to the global minimum of arbitrary n-th degree polynomials on the sphere, by discrete minimization on
Two methods for the maximization of homogeneous polynomials over the simplex
• Mathematics
Comput. Optim. Appl.
• 2021
The convergence properties of the so-called replicator dynamics for solving P are discussed and an ascent method, which also makes use of the replicator transformation, is examined.
A note on total degree polynomial optimization by Chebyshev grids
• Computer Science, Mathematics
Optim. Lett.
• 2018
Using the approximation theory notions of polynomial mesh and Dubiner distance in a compact set, we derive error estimates for total degree polynomial optimization on Chebyshev grids of the hypercube.
O C ] 4 J un 2 01 8 Approximation Hierarchies for Copositive Tensor Cone
• Computer Science
• 2018
Copositive tensors, which are a natural generalization of the copositive matrices, are discussed; an analysis of some basic properties are presented; as well as the conditions under which class of coposive tensors and the class of positive semidefinite tensors coincides.
Approximation Hierarchies for Copositive Tensor Cone
• Computer Science
• 2018
Copositive tensors, which are a natural generalization of the copositive matrices, are discussed; an analysis of some basic properties are presented; as well as the conditions under which class of coposive tensors and the class of positive semidefinite tensors coincides.

## References

SHOWING 1-10 OF 13 REFERENCES
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
• Mathematics, Computer Science
SIAM J. Optim.
• 2015
This paper considers a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r) and shows that the associated convergence rate is$O(1/r^2)\$ for quadratic polynomials.
Rounding on the standard simplex: regular grids for global optimization
• Computer Science, Mathematics
J. Glob. Optim.
• 2014
It is shown that the minimal distance to the regular grid on the standard simplex can exceed one, even for very fine mesh sizes in high dimensions.
Random walk in a simplex and quadratic optimization over convex polytopes
Probabilistic arguments for justifying the quality of an approximate solution for global quadratic minimization problem are developed, obtained as a best point among all points of a uniform grid inside a polyhedral feasible set and some related problems are shown to be NP-hard.
A PTAS for the minimization of polynomials of fixed degree over the simplex
• Mathematics, Computer Science
Theor. Comput. Sci.
• 2006
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
• Mathematics, Computer Science
Math. Program.
• 2015
New insight is provided into the polynomial-time approximation scheme for polynomials of fixed degree by establishing precise links with Bernstein approximation and the multinomial distribution.
The complexity of approximating a nonlinear program
• Mathematics, Computer Science
Math. Program.
• 1995
This work considers the problem of finding the maximum of a multivariate polynomial inside a convex polytope and shows that even when the polynomic is quadratic there is no polynometric time approximation unless NP is contained in quasi-polynomial time.
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
• Mathematics, Computer Science
J. Glob. Optim.
• 2002
This paper shows how to approximate the optimal solution by approximating the cone of copositive matrices via systems of linear inequalities, and, more refined, linear matrix inequalities (LMI's).
Structure Preserving Reductions among Convex Optimization Problems
• Computer Science, Mathematics
J. Comput. Syst. Sci.
• 1980
Convex Optimization
• Computer Science
IEEE Transactions on Automatic Control
• 2006
A comprehensive introduction to the subject of convex optimization shows in detail how such problems can be solved numerically with great efficiency.
Global Optimization of Homogeneous Polynomials on the Simplex and on the Sphere
We obtain rigorous estimates for linear and semidefinite relaxations of global optimization problems on the simplex and on the sphere