A numerical study of limited memory BFGS methods

Applied Mathematics Letters

Volumn 15, Issue 4, 2002, Pages 481-487

  Morales, J L ^a,b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b INSTITUTO TECNOLÓGICO AUTÓNOMO DE MÉXICO   (Mexico)

Author keywords

BFGS formula; Limited memory method; Quasi Newton methods

Indexed keywords

EID: 31244437221     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(01)00162-8     Document Type: Article

References (8)

1. J.E. Dennis, Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, (1983).
2. nd Edition, John Wiley & Sons, New York, (1987).
3. J. Nocedal and S.J. Wright, Numerical Optimization, Springer-Verlag, New York, (1999).
4. P.E. Gill, W. Murray, and M.A. Saunders, SNOPT: An SQP algorithm for large-scale constrained optimization, Report NA 97-2, Dept. of Mathematics, University of California, San Diego, CA.
5. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math. Comput. 35, 773-782, (1980).
6. I. Bongartz, A.R. Conn, N.I.M. Gould and Ph.L. Toint, CUTE: Constrained and Unconstrained Testing Environment, ACM Trans. Math. Software 21, 123-160, (1995).
7. J.J. Moré and D.J. Thuente, Line search algorithms with guaranteed sufficient decrease, ACM Trans. Math. Software 20, 286-307, (1994).
8. J. Nocedal, Personal communication.