Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
No abstract is available for this item.
Volume (Year): 51 (2012)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.springer.com/math/journal/10589|
|Order Information:||Web: http://link.springer.de/orders.htm|
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, 2004. "Rounding of convex sets and efficient gradient methods for linear programming problems," CORE Discussion Papers 2004004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:51:y:2012:i:1:p:241-257. 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 (Christopher F Baum)
If references are entirely missing, you can add them using this form.