Minimizing functions with bounded variation of subgradients
Download full text from publisher
References listed on IDEAS
- NESTEROV, Yu., 2005. "Primal-dual subgradient methods for convex problems," CORE Discussion Papers 2005067, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
More about this item
Keywordsconvex optimization; subgradient methods; non-smooth optimization; blackbox methods; lower complexity bounds;
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:2005079. 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 .