This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. M. Danilin and B. N. Pshenichnyi, “Minimization methods with accelerated convergence,” Zh. Vychisl. Mat. i Mat. Fiz.,10, No. 6 (1970).
Yu. M. Danilin, “Conjugate direction methods for minimization methods,” Kibernetika, No. 5 (1971).
Yu. M. Danilin and B. N. Pshenichnyi, “Minimization methods without derivative evaluation,” Zh. Vychisl. Mat. i Mat. Fiz.,11, No. 1 (1971).
Yu. M. Danilin, “Minimization methods based on approximating convex functionals,” Zh. Vychisl. Mat. i. Mat. Fiz.,10, No. 5 (1970).
V. F. Den'yanov and A. B. Pevnyi, “Numerical methods of finding saddle points,” Zh. Vychisl. Mat. i Mat. Fiz.,12, No. 5 (1972).
B. T. Polyak, “Gradient methods of minimizing functionals,” Zh. Vychisl. Mat. i Mat. Fiz.,3, No. 4 (1963).
I. S. Berezin and N. P. Zhidkov, Numerical Methods [in Russian], Vol. 1, Nauka, Moscow (1966).
H. Y. Huang Nagvi, “Unconstrained approach to the extremization of constrained functions,” J. Math. Anal. Appl.,39, No. 2 (1972).
Additional information
Translated from Kibemetika, No. 3, pp. 119–124, May–June, 1974.
Rights and permissions
About this article
Cite this article
Danilin, Y.M., Panin, V.M. Methods of searching saddle points. Cybern Syst Anal 10, 514–520 (1974). https://doi.org/10.1007/BF01068722
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068722