L-broyden methods: A generalization of the l-bfgs method to the limited-memory broyden family

International Journal of Computer Mathematics

Volumn 86, Issue 4, 2009, Pages 606-615

  Reed, M B ^a  

^a University of Bath   (United Kingdom)

Author keywords

L BFGS; Limited memory; Quasi Newton methods; Unconstrained optimisation

Indexed keywords

BROYDEN-FLETCHER-GOLDFARB-SHANNO; DAVIDON-FLETCHER-POWELL; L-BFGS; LIMITED MEMORY; MULTIPLICATIVE UPDATES; NUMERICAL RESULTS; OPTIMISATIONS; QUASI-NEWTON METHODS;

NEWTON-RAPHSON METHOD; OPTIMIZATION;

NUMERICAL METHODS;

EID: 68249093308     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160701656749     Document Type: Article

References (16)

1. A. Buckley, Test functions for unconstrained minimization, Tech. Rep. 1989CS-3, Department of Mathematics, Statistics and Computer Science, Dalhousie University, Halifax, Canada, 1989.
2. A. Buckley and A. LeNir, QN-like variable storage conjugate gradients, Math. Program 27 (1983), pp. 155-175.
3. A. Buckley and A. LeNir, ALGORITHM 630: BBVSCG - a variable storage algorithm for function minimization, ACM Trans. Math. Softw. 11 (1985), pp. 103-119.
4. A. Buckley and A. LeNir, Remark on algorithm 630, ACM Trans. Math. Softw. 15 (1989), pp. 262-274.
5. R.H. Byrd, J. Nocedal, and R.B. Schnabel, Representation of quasi-Newton matrices and their use in limited memory methods, Math. Program 63 (1994), pp. 129-156.
6. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, Convergence of quasi-Newton matrices generated by the symmetric rank one update, Math. Program 46 (1990), pp. 177-195.
7. T.G. Kolda, D.P. O'Leary, and L. Nazareth, BFGS with update skipping and varying memory, SIAM J. Optim. 6 (1998), pp. 1060-1083.
8. D.C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Math. Program 45 (1989), pp. 503-528.
9. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math. Comput. 35 (1980), pp. 773-782.
10. S.S. Oren and E. Spedicato, Optimal conditioning of self-scaling variable metric algorithms, Math. Program 10 (1976), pp. 70-90.
11. M.R. Osborne and L.P. Sun, A new approach to the symmetric rank one updating algorithm, IMA J. Numer. Anal. 19 (1999), pp. 497-507.
12. M.J.D. Powell, Restart procedures for the conjugate gradient method, Math. Program 12 (1977), pp. 241-254.
13. D.F. Shanno and K.-H. Phua, Numerical comparison of several variable metric algorithms, J. Optim. Theory Appl. 25 (1978), pp. 507-518.
14. D.F. Shanno and K.-H. Phua, Matrix conditioning and nonlinear optimization, Math. Program 14 (1978), pp. 149-160.
15. L.P. Sun, Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization, Comput. Optim. Appl. 27 (2004), pp. 23-29.
16. J.Vlcek and L. Luksan, New variable metric methods for unconstrained minimisation covering the large-scale case, Tech. Rep. V876, Institute of Computer Science, Prague, Czech Republic, 2002.