Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization

Optimization Methods and Software

Volumn 22, Issue 4, 2007, Pages 561-571

  Andrei, Neculai ^a  

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

Author keywords

BFGS preconditioning; Conjugate gradient method; Spectral gradient method; Unconstrained optimization; Wolfe line search

Indexed keywords

COMPUTATIONAL METHODS; CONJUGATE GRADIENT METHOD; CONSTRAINED OPTIMIZATION; MATRIX ALGEBRA;

BFGS PRECONDITIONING; SPECTRAL GRADIENT METHOD; UNCONSTRAINED OPTIMIZATION; WOLFE LINE SEARCH;

ALGORITHMS;

EID: 34147204085     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780600822260     Document Type: Article

References (21)

1. Polak, E. and Ribière, G., 1969, Note sur la convergence de méthodes de directions conjuguées. Revue Francaise Informat, Reserche Opérationnelle, 16, 35-43.
2. Fletcher, R. and Reeves, C.M., 1964, Function minimization by conjugate gradients. The Computer Journal, 7, 149-154.
3. Birgin, E. and Martínez, J.M., 2001, A spectral conjugate gradient method for unconstrained optimization. Applied Mathematics and Optimization, 43, 117-128.
4. Dai, Y.H. and Liao, L.Z., 2001, New conjugate conditions and related nonlinear conjugate gradient methods. Applied Mathematics and Optimization, 43, 87-101.
5. Oren, S.S. and Luenberger, D.G., 1976, Self-scaling variable metric algorithm. Part I. Management Science, 20, 845-862.
6. Oren, S.S. and Spedicato, E., 1976, Optimal conditioning of self-scaling variable metric algorithms. Mathematical Programming, 10, 70-90.
7. Perry, J.M., 1977, 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.
8. Shanno, D.F., 1978, Conjugate gradient methods with inexact searches. Mathematics of Operations Research, 3, 244-256.
9. Shanno, D.F., 1978, On the convergence of a new conjugate gradient algorithm. SIAM Journal on Numerical Analysis 15, 1247-1257.
10. Raydan, M., 1997, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM Journal of Optimization, 7, 26-33.
11. Bongartz, I, Conn, A.R., Gould, N.I.M. and Toint, P.L., 1995, CUTE: constrained and unconstrained testing environments. ACM Transactions on Mathematical Software, 21, 123-160.
12. Hager, W.W. and Zhang, H., 2005, A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM Journal on Optimization, 16, 170-192.
13. Hager, W.W. and Zhang, H., 2006, Algorithm 851 : CG_DESCENT, A conjugate gradient method with guaranteed descent. ACM Transactions of Mathematical Software, 32, 113-137.
14. Hestenes, M.R. and Stiefel, E., 1952, Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, Section B, 48, 409-436.
15. Wolfe, P., 1969, Convergence conditions for ascent methods. SIAM Review, 11, 226-235.
16. Wolfe, P., 1971, Convergence conditions for ascent methods II: some corrections. SIAM Review, 13, 185-188.
17. Powell, M.J.D., 1976, Some convergence properties of the conjugate gradient method. Mathematical Programming, 11, 42-49.
18. Powell, M.J.D., 1977, Restart procedures for the conjugate gradient method. Mathematical Programming, 12, 241-254.
19. Shanno, D.F. and Phua, K.H., 1976, Algorithm 500, minimization of unconstrained multivariate functions. ACM Transactions on Mathematical Software, 2, 87-94.
20. Dai, Y.H. and Yuan, Y., 1998, Convergence properties of the Beale-Powell restart algorithm. Science in China (Series A), 41(11), 1142-1150.
21. Andrei, N., Available online at: http://www.ici.ro/camo/neculai/anpaper. htm/