research
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey
- Publication date
- Publisher
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.computational complexity;global optimization;linear and semidefinite programming;approximation algorithms