@techreport{3789955a65334a4eaca26dd7244fab83,
title = "On the Complexity of Optimization over the Standard Simplex",
abstract = "We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with uniformly bounded Hessians over the standard simplex.This extends an earlier result by De Klerk, Laurent and Parrilo [A PTAS for the minimization of polynomials of fixed degree over the simplex, Theoretical Computer Science, to appear.]",
keywords = "global optimization, standard simplex, PTAS, multivariate Bernstein approximation, semidefinite programming",
author = "{de Klerk}, E. and {den Hertog}, D. and G.E.E. Elfadul",
note = "Subsequently published in the European Journal of Operational Research, 2008 Pagination: 13",
year = "2005",
language = "English",
volume = "2005-125",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}