Abstract
Polyak's subgradient algorithm for nondifferentiable optimization problems requires prior knowledge of the optimal value of the objective function to find an optimal solution. In this paper we extend the convergence properties of the Polyak's subgradient algorithm with a fixed target value to a more general case with variable target values. Then a target value updating scheme is provided which finds an optimal solution without prior knowledge of the optimal objective value. The convergence proof of the scheme is provided and computational results of the scheme are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Allen, R. Helgason, J. Kennington and B. Shetty, “A generalization of Polyak's convergence result for subgradient optimization,”Mathematical Programming 37 (1987) 309–317.
M.S. Bazaraa and H.D. Sherali, “On the choice of step size in subgradient optimization,”European Journal of Operational Research 7 (1981) 380–388.
P.M. Camerini, L. Fratta and F. Maffioli, “On improving relaxation methods by modified gradient techniques,”Mathematical Programming Study 3 (1975) 26–34.
V.F. Dem'yanov and L.V. Vasil'ev,Nondifferentiable Optimization (Optimization Software, New York, 1985).
A.V. Fiacco and J. Kyparisis, “Computable bounds on parametric solutions of convex problems,”Mathematical Programming 35 (1988) 279–297.
M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization,”Mathematical Programming 6 (1974) 66–68.
S. Kim, S. Koh and H. Ahn, “Two-direction subgradient method for nondifferentiable optimization problems,”Operations Research Letters 6 (1987) 43–46.
B.T. Polyak, “A general method of solving extremum problems,”Soviet Mathematics Doklady 8 (1967) 593–597.
B.T. Polyak, “Minimization of unsmooth functionals,”USSR Computational Mathematics and Mathematical Physics 9 (1969) 14–29.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
S. Sen and H.D. Sherali, “A class of convergent primal—dual subgradient algorithms for decomposable convex programs,”Mathematical Programming 40 (1988) 213–221.
N.Z. Shor, “On the structure of algorithms for the numerical solution of optimal planning and design problems,” Ph.D. Dissertation, Cybernetics Institute, Academy of Science (USSR, 1964).
N.Z. Shor,Minimization Methods for Non-Differentiable Functions (Springer, Berlin, 1985).
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. & Cho, SC. Variable target value subgradient method. Mathematical Programming 49, 359–369 (1990). https://doi.org/10.1007/BF01588797
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588797