The complexity of optimizing over a simplex, hypercube or sphere: a short survey
No abstract is available for this item.
Volume (Year): 16 (2008)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10100 |
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
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).
- repec:ner:tilbur:urn:nbn:nl:ui:12-195047 is not listed on IDEAS
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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.