A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Complexity of Optimizing Over a Simplex, Hypercube or Sphere: A Short Survey
2006
Social Science Research Network
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.2139/ssrn.932525
fatcat:pbbyh6pjmngg7afefazjvgb7zm