×

Conjugate gradient methods using quasi-Newton updates with inexact line searches. (English) Zbl 0711.65046

A scaled modified version of the conjugate gradient method using quasi- Newton updates for minimization problems is presented. Computational results on standard test problem are given.
Reviewer: S.Filippi

MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
65F10 Iterative numerical methods for linear systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bazaraa, M. S.; Shetty, C. M., Nonlinear Programming: Theory and Algorithms (1979), Wiley: Wiley New York, NY · Zbl 0476.90035
[2] Beale, E. M.L, A derivation of conjugate gradients, (Lootsma, F. A., Numerical Methods for Nonlinear Optimization (1972), Academic Press: Academic Press New York/London), 39-43 · Zbl 0279.65052
[3] Dixon, L. C.W; Ducksburg, P. G.; Singh, P., A new three-term conjugate gradient method, J. Optim. Theory Appl., 47, No. 3, 285-300 (1985) · Zbl 0556.90077
[4] Fletcher, R.; Powell, M. J.D, A rapidly convergent descent method for minimization, Comput. J., 6, 163-168 (1963) · Zbl 0132.11603
[5] Fletcher, R.; Reeves, C. M., Function minimization by conjugate gradients, Comput. J., 7, 149-154 (1964) · Zbl 0132.11701
[6] Hestnes, M. R., Conjugate Direction Methods in Optimization (1980), Springer-Verlag: Springer-Verlag Berlin
[7] Hestenes, M. R.; Stiefel, E., Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards Sec. B, 48, 409-436 (1952) · Zbl 0048.09901
[8] Kowalik, J.; Osborne, M. R., Methods for Unconstrained Optimization Problems (1968), Elsevier: Elsevier New York · Zbl 0304.90099
[9] Luenberger, D. G., Introduction to Linear and Nonlinear Programming (1984), Addison-Wesley: Addison-Wesley Amsterdam · Zbl 0241.90052
[10] McCormick, G. P.; Ritter, K., Alternative proofs of the convergence properties of the conjugate-gradient method, J. Optim. Theory Appl., 13, No. 5, 497-518 (1974) · Zbl 0261.90053
[11] Nazareth, L., A conjugate direction algorithm without line searches, J. Optim. Theory Appl., 23, No. 3, 373-387 (1977) · Zbl 0348.65061
[12] Nazareth, L., A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms, SIAM J. Numer. Anal., 16, No. 5, 794-800 (1979) · Zbl 0424.65030
[13] Nazareth, L., Conjugate gradient methods less dependent on conjugacy, SIAM Rev., 28, No. 4, 501-511 (1986) · Zbl 0625.90077
[14] Oren, S. S.; Spedicato, E., Optimal conditioning of self-scaling variable metric algorithms, Math. Programming, 10, 70-90 (1976) · Zbl 0342.90045
[15] Perry, A., A modified conjugate gradient algorithm, Oper. Res., 26, No. 6, 1073-1078 (1978) · Zbl 0419.90074
[16] Polak, E.; Ribiere, G., Note sur la convergence des méthodes de directions conjuguées, Rev. Fr. Inf. Rech. Oper., 16, 35-43 (1969) · Zbl 0174.48001
[17] Powell, M. J.D, Recent advances in unconstrained optimization, Math. Programming, 1, 26-57 (1971) · Zbl 0228.90042
[18] Powell, M. J.D, Restart procedures for the conjugate gradient method, Math. Programming, 12, 241-254 (1977) · Zbl 0396.90072
[19] Powell, M. J.D, Convergence properties of algorithms for nonlinear optimization, SIAM Rev., 28, No. 4, 487-499 (1986) · Zbl 0624.90091
[20] Rosenbrock, H. H., An automatic method for finding the greatest or least value of a function, Computer J., 3, 175-184 (1960)
[21] Shanno, D. F., Conjugate gradient methods with inexact searches, Math. Oper. Res., 3, No. 3, 244-256 (1978) · Zbl 0399.90077
[22] Spedicato, E., Computational Experience with Quasi-Newton Algorithms for Minimization Problems of Moderately Large Size, (Report CISE-N-175 (1975), CISE: CISE Segrate (Milano), Italy) · Zbl 0397.90088
[23] Witte, B. F.W; Holst, W. R., Two new direct minimum search procedures for functions of several variables, (1964 Spring Joint Computer Conference, Vol. 25 (1964)), 195-209 · Zbl 0154.40307
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.