Linear Convergence of Epsilon-Subgradient Descent Methods for a Class of Convex Functions
AbstractThis paper establishes a linear convergence rate for a class of epsilon-subgradient descent methods for minimizing certain convex functions. Currently prominent methods belonging to this class include the resolvent (proximal point) method and the bundle method in proximal form (considered as a sequence of serious steps). Other methods, such as the recently proposed descent proximal level method, may also fit this framework depending on implementation. The convex functions covered by the analysis are those whose conjugates have subdifferentials that are locally upper Lipschitzian at the origin, a class introduced by Zhang and Treiman. We argue that this class is a natural candidate for study in connection with minimization algorithms.
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 InfoPaper provided by International Institute for Applied Systems Analysis in its series Working Papers with number wp96041.
Date of creation: Apr 1996
Date of revision:
Contact details of provider:
Postal: A-2361 Laxenburg
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Thomas Krichel).
If references are entirely missing, you can add them using this form.