Abstract.
This paper establishes a linear convergence rate for a class of epsilon-subgradient descent methods for minimizing certain convex functions on ℝn. 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 a variant of the proximal point method given by Correa and Lemaréchal, can also fit within this framework, depending on how they are implemented. The convex functions covered by the analysis are those whose conjugates have subdifferentials that are locally upper Lipschitzian at the origin, a property generalizing classical regularity conditions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received March 29, 1996 / Revised version received March 5, 1999¶ Published online June 11, 1999
Rights and permissions
About this article
Cite this article
Robinson, S. Linear convergence of epsilon-subgradient descent methods for a class of convex functions. Math. Program. 86, 41–50 (1999). https://doi.org/10.1007/s101070050078
Issue Date:
DOI: https://doi.org/10.1007/s101070050078