The complexity of optimizing over a simplex, hypercube or sphere: a short survey
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Central European Journal of Operations Research.
Volume (Year): 16 (2008)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.springer.com/business/operations+research/journal/10100
Find related papers by JEL classification:
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).
- Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
- Immanuel Bomze & Werner Schachinger & Gabriele Uchida, 2012. "Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 423-445, March.
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.