Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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).
More about this item
KeywordsMinimum volume ellipsoids; Rank-two update algorithms; Sequential minimal optimization; Core sets; Approximation algorithms; Complexity analysis;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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 (Rebekah McClure). General contact details of provider: http://www.springer.com .