A scaled nonlinear conjugate gradient algorithm for unconstrained optimization

Optimization

Volumn 57, Issue 4, 2008, Pages 549-570

  Andrei, Neculai ^a  

^a NATIONAL INSTITUTE FOR RESEARCH AND DEVELOPMENT IN INFORMATICS   (Romania)

Author keywords

BFGS formula; Conjugate gradient method; Numerical comparisons; Spectral gradient method; Unconstrained optimization

Indexed keywords

EID: 45749094600     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930601127909     Document Type: Article

References (25)

1. N. Andrei, A new gradient descent method for unconstrained optimization, ICI Technical Report, March 2004.
2. J. Barzilai and J.M. Borwein, Two point step size gradient method, IMA J. Num. Anal. 8 (1998), pp. 141-148.
3. E. Birgin and J.M. Martínez, A spectral conjugate gradient method for unconstrained optimization, Appl. Math. Optim. 43 (2001), pp. 117-128.
4. I. Bongartz, A.R. Conn, N.I.M. Gould, and P.L. Toint, CUTE: constrained and unconstrained testing environments, ACM Transactions on Mathematical Software 21 (1995), pp. 123-160.
5. A. Cauchy, Méthodes générales pour la résolution des systèmes déquations simultanées, C.R. de l'Académie des Sciences. Paris, 25 (1847), pp. 536-538.
6. Y.H. Dai and L.Z. Liao, New conjugate conditions and related nonlinear conjugate gradient methods, Appl. Math. Optim. 43 (2001), pp. 87-101.
7. Y.H. Dai and J.Y. Yuan, Convergence properties of the Beale-Powell restart algorithm, Sciences in China (Series A) 41(11) (1998), pp. 1142-1150.
8. Y.H. Dai, J.Y. Yuan, and Y. Yuan, Modified two-point stepsize gradient methods for unconstrained optimization, Comput. Optim. Appl. 22 (2002), pp. 103-109.
9. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201-213.
10. R. Fletcher, On the Barzilai-Borwein method, in Optimization and Control Applications, L. Qi, K. Teo, and X. Yang, eds., Series: Applied Optimization, Vol. 96, Springer, Berlin, pp. 235-256.
11. R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients, Com. J. 7 (1964), pp. 149-154.
12. W.W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM J. Optim. 16 (2005), pp. 170-192.
13. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bureau Stand. Sec. B 48 (1952), pp. 409-436.
14. S.S. Oren, Self-scaling variable metric algorithm. Part II, Manag. Sci. 20 (1974), pp. 863-874.
15. S.S. Oren and D.G. Luenberger, Self-scaling variable metric algorithm. Part I, Manag. Sci. 20 (1976), pp. 845-862.
16. S.S. Oren and E. Spedicato, Optimal conditioning of self-scaling variable metric algorithms, Math. Prog. 10 (1976), pp. 70-90.
17. J.M. Perry, A class of conjugate gradient algorithms with a two step variable metric memory, Discussion Paper 269, Center for Mathematical Studies in Economics and Management Science, Northwestern University, 1977.
18. E. Polak and G. Ribière, Note sur la convergence de méthodes de directions conjuguées, Revue Francaise Informat. Reserche Opérationnelle. 16 (1969), pp. 35-43.
19. M.J.D. Powell, Restart procedures for the conjugate gradient method, Math. Prog. 12 (1977), pp. 241-254.
20. M. Raydan, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM J. Optim. 7 (1997), pp. 26-33.
21. D.F. Shanno, Conjugate gradient methods with inexact searches, Math. Oper. Res. 3 (1978), pp. 244-256.
22. _, On the convergence of a new conjugate gradient algorithm, SIAM J. Num. Anal. 15 (1978), pp. 1247-1257.
23. D.F. Shanno and K.H. Phua, Algorithm 500, minimization of unconstrained multivariate functions, ACM Transactions on Mathematical Software 2 (1976), pp. 87-94.
24. P. Wolfe, Convergence conditions for ascent methods, SIAM Rev. 11 (1969), pp. 226-235.
25. _, Convergence conditions for ascent methods II: some corrections, SIAM Rev. 13 (1971), pp. 185-188.