Rounding of convex sets and efficient gradient methods for linear programming problems
Download full text from publisher
References listed on IDEAS
- NESTEROV, Yu, 2003. "Unconstrained convex minimization in relative scale," CORE Discussion Papers 2003096, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Wei-jie Cong & Hong-wei Liu & Feng Ye & Shui-sheng Zhou, 2012. "Rank-two update algorithms for the minimum volume enclosing ellipsoid problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 241-257, January.
More about this item
Keywordsnonlinear optimization; convex optimization; complexity bounds; relative accuracy; fully polynomial approximation schemes; gradient methods; optimal methods;
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:cor:louvco:2004004. 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: (Alain GILLIS). General contact details of provider: http://edirc.repec.org/data/coreebe.html .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.