Literature Cited
B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremum Problems [in Russian], Nauka, Moscow (1975).
Yu. M. Danilin and B. N. Pshenichnyi, “Estimating the rate of convergence of a certain class of minimization algorithms,” Dokl. Akad. Nauk SSSR, 213, No. 3 (1973).
Yu. M. Danilin, “Conjugate direction methods which do not require solving one-dimensional minimization problems,” Dokl. Akad. Nauk SSSR, 21, No. 3 (1974).
A. P. Bulanyi and Yu. M. Danilin, “Quasi-Newtonian minimization algorithms based on the construction of conjugate vector systems,” Zh. Vychisl. Mat. Mat. Fiz., No. 4 (1978).
I. S. Berezin and N. P. Zhidkov, Computation Methods [in Russian], Vol. 1, Nauka, Moscow (1966).
Yu. M. Danilin and V. M. Panin, “Some methods of saddle point searching,” Kibernetika, No. 3 (1974).
Numerical Methods of Constrained Optimization [Russian translation], Mir, Moscow (1977).
S. M. Robinson, “A quadratically convergent algorithm for general programming problems,” Math. Prog., No. 3 (1972).
M. J. D. Powell, “Algorithms for nonlinear constraints that use Lagrangian functions,” Math. Prog., 14, No. 2 (1978).
Additional information
Translated from Kibernetika, No. 5, pp. 80–86, September–October, 1979.
Rights and permissions
About this article
Cite this article
Danilin, Y.M., Morar', V.A. Quasi-Newtonian methods of constrained optimization. Cybern Syst Anal 15, 689–697 (1979). https://doi.org/10.1007/BF01071220
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071220