This is a preview of subscription content, log in via an institution to check access.
Literature Cited
M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear system,” J. Res. Nat. Bur. Stds.,49, No. 6, 409–436 (1952).
W. C. Davidon, Variable-Metric Method for Minimization, Argonne Nat. Lab., Rep. No. ANL-5990 (1959).
R. Fletcher and M. J. D. Powell, “A rapidly convergent descent method for minimization,” Comput. J.,6, No. 2, 163–168 (1963).
C. G. Broyden, “Quasi-Newton methods and their application to function minimization,” Math. Comput.,21, No. 99, 368–381 (1967).
G. P. McCormick and J. D. Pearson, “Variable-metric methods and unconstrained optimization,” Conf. Optimization, Keele Hall, England (March, 1968).
J. D. Pearson, “Variable metric methods of minimization,” Comput. J.,12, No. 2, 171–178 (1969).
J. Greenstadt, “Variations on variable-metric methods,” Math. Comput.,24, No. 109 1–22 (1970).
D. Goldfarb, “A family of variable-metric methods derived by variational means,” Math. Comput.,24, No. 109, 23–26 (1970).
H. Y. Huang, “Unified approach to quadratically convergent algorithms for function minimization,” J. Optim. Theory Appl.,5, No. 6 (1970).
R. Fletcher and C. M. Reeves, “Function minimization by conjugate gradients,” Comput. J.,7, No. 2, 149–154 (1964).
J. W. Daniel, “Convergence of the conjugate gradient method with computationally convenient modifications. Numer. Math.,10, No. 2, 125–131 (1967).
F. L. Zeleznik, “Quasi-Newton methods for nonlinear equations,” J. Assoc. Computing Mach.,15, No. 2, 265–271 (1968).
B. T. Polyak, “Method of conjugate gradients,” Proc. Second School on Mathematical Programming and Related Problems [in Russian], No. 1, Drogobych (1969), pp. 152–201.
A. A. Goldstein and B. F. Price, “An effective algorithm for minization,” Numer. Math.,10, No. 3, 184–189 (1967).
Yu. M. Danilin and B. N. Pshenichnyi, “Minimization methods with accelerated convergence,” Zh. Vychislit. Matem. i Matem. Fiz.,10, No. 6, 1341–1354 (1970).
M. N. Yakovlev, “Methods for the solution of nonlinear equations,” Trudy Matem. Inst. Akad. Nauk SSSR,84, 8–40 (1965).
H. Y. Huang and A. V. Levy, “Numerical experiments on quadratically convergent algorithms for function minimization, J. Optim. Theory Appl.,6, No. 3, 269–282 (1970).
B. N. Pshenichnyi, “A descent algorithm,” Zh. Vychislit. Matem. i Matem. Fiz.,8, No. 3, 647–652 (1968).
W. C. Davison, “Variance algorithm for minimization,” Comput. J.,10. No. 4, 406–410 (1968).
M. J. D. Powell, “A survey of numerical methods for unconstrained optimization,” SIAM Rev.,2, No. 1, 79–97 (1970).
B. A. Murtagh and R. W. H. Sargent, “Computational experience with quadratically convergent minimization methods,” Comput. J., 13, No. 2, 185–194 (1970).
R. Fletcher, “A new approach to variable metric algorithms,” Comput. J.,13, No. 3, 317–322 (1970).
Additional information
Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev. Translated from Kibernetika, No. 5, pp. 122–136, September–October, 1971.
Rights and permissions
About this article
Cite this article
Danilin, Y.M. Methods of conjugate directions for the solution of minimization problems. Cybern Syst Anal 7, 903–919 (1971). https://doi.org/10.1007/BF01641513
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01641513