The complexity of optimizing over a simplex, hypercube or sphere: a short survey

Etienne de Klerk
2007 Central European Journal of Operations Research  
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere. These relatively simple optimization problems arise naturally from diverse applications. We review known approximation results as well as negative (inapproximability) results from the recent literature.
doi:10.1007/s10100-007-0052-9 fatcat:3iynpel655hohamavx6dlmcqim