An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems—it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a polynomial-time approximation scheme (PTAS) for polynomials of fixed degree, which is based on polynomial evaluations at the points of a sequence of regular grids. In this paper, we provide an alternative proof of the PTAS property. The proof relies on the properties of Bernstein approximation on the simplex. We also refine a known error bound for the scheme for polynomials of degree three. The main contribution of the paper is to provide new insight into the PTAS by establishing precise links with Bernstein approximation and the multinomial distribution.
KeywordsPolynomial optimization over a simplex PTAS Bernstein approximation
Mathematics Subject Classification90C30 90C60
- 4.Bomze, I.M., Gollowitzer, S., Yildirim, E.A.: Rounding on the standard simplex: regular grids for global optimization. J. Global Optim. 59(2–3), 243–258 (2014)Google Scholar
- 16.Nesterov, Y.: Random Walk in a Simplex and Quadratic Optimization over Convex Polytopes. CORE Discussion Paper 2003/71, CORE-UCL, Louvain-La-Neuve (2003)Google Scholar
- 18.Sagol, G., Yildirim, E.A.: Analysis of Copositive Optimization Based Bounds on Standard Quadratic Optimization. Technical Report. Department of Industrial Engineering, Koc University, Sariyer, Istanbul, Turkey (2013)Google Scholar
- 19.Vavasis, S.: Approximation algorithms for concave quadratic programming. In: Floudas, C.A., Pardalos, P. (eds.) Recent Advances in Global Optimization, pp. 3–18. Princeton University Press, Princeton (1998)Google Scholar