This is a preview of subscription content, log in via an institution to check access.
Literature Cited
N.Z. Shor, “The use of space extension in problems of minimizing convex functions,” Kibernetika,6, No. 1, Kiev (1970).
N.Z. Shor, “The rate of convergence of the generalized gradient descent method with space extension,” Kibernetika,6, No. 2, Kiev (1970).
Yu.I. Lyubich, “The general theory of relaxation processes for convex functionals,” Usp. Matem. Nauk, No. 1, Moscow (1970).
B.T. Polyak, “The conjugate gradient method,” Proceedings of the 2nd Winter School on Mathematical Programming and Allied Problems (Drogobych) [in Russian], No. 1, Moscow (1969).
H. Rosenbrock and C. Storey, Computational Methods for Chemical Engineers, Pergamon (1965).
H.I. Huang and A.V. Levy, “Experiments on quadratically convergent algorithms for function minimization,” J. Optimization Theory and Applications,3, No. 6 (1970).
Additional information
Translated from Kibernetika, No. 3, pp. 51–59, May–June, 1971.
Rights and permissions
About this article
Cite this article
Shor, N.Z., Zhurbenko, N.G. A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients. Cybern Syst Anal 7, 450–459 (1971). https://doi.org/10.1007/BF01070454
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070454