Abstract
A generalized subgradient method is considered which uses the subgradients at previous iterations as well as the subgradient at current point. This method is a direct generalization of the usual subgradient method. We provide two sets of convergence conditions of the generalized subgradient method. Our results provide a larger class of sequences which converge to a minimum point and more freedom of adjustment to accelerate the speed of convergence.
Similar content being viewed by others
References
P.M. Camerini, L. Fratta and F. Maffioli, “On improving relaxation methods by modified gradient techniques,”Mathematical Programming Study 3 (1975) 26–34.
N.D. Chepurnoj, “Adaptive nonmonotonic methods with averaging of subgradients,” WP-87-62, IIASA (Laxenburg, 1987).
N.D. Chepurnoj, “Averaged quasi-gradient method with stepsize regulation to minimize weakly convex functions,”Kibernetika (4) (1982) 127–129.
V.F. Dem'yanov and L.V. Vasil'ev,Nondifferentiable Optimization (Optimization Software, New York, 1985).
Ju.M. Ermol'ev,Stochastic Programming Methods (Nauka, Moskow, 1976).
Ju.M. Ermol'ev and N.Z. Shor, “On minimization of non-differentiable functions,”Kibernetika (1) (1967) 101–102.
O.V. Glushkova and A.M. Gupal, “About nonmonotonic methods of nonsmooth function minimization with averaging of subgradients,”Kibernetika (6) (1980) 128–129.
A.M. Gupal and L.G. Bazhenov, “Stochastic analog to conjugate gradient method,”Kibernetika (1) (1972) 125–126.
S. Kim and S. Koh, “On Polyak's improved subgradient method,”Journal of Optimization Theory and Applications, forthcoming.
S. Kim, S. Koh and H. Ahn, “Two-direction subgradient method for non-differentiable optimization problems,”Operations Research Letters 6 (1) (1987) 43–46.
K.C. Kiwiel, “An aggregate subgradient method for nonsmooth convex minimization,”Mathematical Programming 27 (1983) 320–341.
C. Lemaréchal, “An algorithm for minimizing convex functions,”Information Processing '74 (1974) pp. 552–556.
V.N. Norkin, “Method of nondifferentiable function minimization with averaging of generalized gradients,”Kibernetika (6) (1980) 86–89.
E.A. Nurminskij and A.A. Zhelikhovskij, “ε-Quasigradient method for solving nonsmooth extremal problems,”Kibernetika (1) (1977) 109–113.
E.A. Nurminskij and A.A. Zhelikhovskij, “Investigation of one regulation of stepsize in quasigradient method for minimizing weakly convex functions,”Kibernetika (6) (1974) 101–105.
B.T. Polyak, “Minimization of unsmooth functionals,”USSR Computational Mathematics and Mathematical Physics 9 (1969) 14–29.
B.T. Polyak, “A general method of solving extremum problems,”Soviet Mathematics Dolkady 8 (1967) 593–597.
N.Z. Shor, “On the structure of algorithms for the numerical solution of optimal planning and design problems,” Ph.D. Dissertation, Cybenetics Institute, Academy of Sciences (USSR, 1964).
N.Z. Shor, “Investigation of space dilation operation in convex function minimization problems,”Kibernetika (1) (1970) 6–12.
N.Z. Shor,Minimization Methods for Non-Differentiable Functions (Springer, Berlin, 1985).
N.Z. Shor, “An application of the gradient descent method for solving a transportation network problem,”Proceedings of the Scientific Seminar on Theoretical and Application Problems of Cybernetics and Operations Research (1962) pp. 9–17.
N.Z. Shor and N.G. Zhurbenko, “Minimization method using space dilation in the direction of difference of two successive gradients,”Kibernetika (3) (1971) 51–59.
Author information
Authors and Affiliations
Additional information
Most of this research was performed when the first author was visiting Decision and Information Systems Department, College of Business, Arizona State University.
Rights and permissions
About this article
Cite this article
Kim, S., Ahn, H. Convergence of a generalized subgradient method for nondifferentiable convex optimization. Mathematical Programming 50, 75–80 (1991). https://doi.org/10.1007/BF01594925
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01594925