This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. V. Rzhevskii, “On a theoretical algorithm for minimizing convex functions,” Kibernetika, No. 6, 13–14 (1979).
R. T. Rockafellar, Convex Analysis, Princeton Univ. Press (1973).
E. A. Nurminskii, “On the continuity of subgradient mappings,” Kibernetika, No. 5, 148–149 (1977).
W. I. Zangwill, Nonlinear Programming. A Unified Approach, Prentice-Hall, Englewood Cliffs, N. J. (1969).
C. Lemarechal, “An extension of Davidon methods to nondifferentiable problems,” in: Mathematical Programming Study 3, North-Holland (1975), pp. 95–109.
C. Lemarechal, “An algorithm for minimizing convex functions,” IFIP Congress, Stockholm (1974), pp. 552–556.
V. L. Makarov and A. M. Rubinov, The Mathematical Theory of Economic Dynamics and Equilibrium [in Russian], Nauka, Moscow (1973).
F. S. Garnir-Monjoie, “Selections continues de multifonctions,” Bull. Soc. Roy. Sci. Liege,46, Nos. 1–2, 51–56 (1977).
E. Polak, Computational Methods in Optimization. A UnifiedApproach, Academic Press, New York (1971).
W. F. Dem'yanov and V. N. Malozemov, Introduction to Minimax [in Russian], Nauka, Moscow (1972).
Additional information
Translated from Kibernetika, No. 1, pp. 109–111, January–February, 1980.
Rights and permissions
About this article
Cite this article
Rzhevskii, S.V. Use of the ɛ-subdifferential of a convex function in a method for minimizing it. Cybern Syst Anal 16, 123–127 (1980). https://doi.org/10.1007/BF01099372
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01099372