The complexity of optimizing over a simplex, hypercube or sphere: a short survey
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. Copyright The Author(s) 2008
Volume (Year): 16 (2008)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.fhi.sk/ssov
Web page: http://www.mot.org.hu/index_en.html
Web page: http://nb.vse.cz/csov/english.htm
Web page: http://www.oegor.at/
Web page: http://hdoi.hr/en_US/en/
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10100|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- NESTEROV, Yu, 2003. "Random walk in a simplex and quadratic optimization over convex polytopes," CORE Discussion Papers 2003071, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:16:y:2008:i:2:p:111-125. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.