@techreport{88640b6d5240472d8669446b519929ed,
title = "The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey",
abstract = "We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as negative (inapproximability) results from the recent literature.",
keywords = "computational complexity, global optimization, linear and semidefinite programming, approximation algorithms",
author = "{de Klerk}, E.",
note = "Subsequently published in the European Journal for Operations Research and Economics, 2008 Pagination: 13",
year = "2006",
language = "English",
volume = "2006-85",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}