BFGS with update skipping and varying memory

SIAM Journal on Optimization

Volumn 8, Issue 4, 1998, Pages 1060-1083

  Kolda, Tamara G ^a   O'Leary, Dianne P ^b   Nazareth, Larry ^c  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b Institute of Advanced Computer Science   (United States)

^c WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

BFGS; Broyden family; Limited memory; Minimization; Quasi Newton; Update skipping

Indexed keywords

EID: 0032333546     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496306450     Document Type: Article

References (30)

1. I. BONGARTZ, A. R. CONN, N. GOULD, AND P. L. TOINT, CUTE ftp site, ftp://thales.math. fundp.ac.be/pub/cute.
2. I. BONGARTZ, A. R. CONN, N. GOULD, AND P. L. TOINT, CUTE home page, http://www.dci. clrc.ac.uk/Activity.asp?CUTE.
3. I. BONGARTZ, A. R. CONN, N. GOULD, AND P. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
4. A. BUCKLEY, Test functions for unconstrained minimization, Tech. Report TR 1989CS-3, Mathematics, Statistics and Computing Centre, Dalhousie University, Halifax (CDN), 1989.
5. R. H. BYRD, J. NOCEDAL, AND R. B. SCHNABEL, Representations of quasi-Newton matrices and their use in limited memory methods, Math. Programming, 63 (1994), pp. 129-156.
6. A. CONN, N. GOULD, M. LESCRENIER, AND P. TOINT, Performance of a multifrontal scheme for partially separable optimization, Tech. Report 88/4, Department of Mathematics, FUNDP, Namur, Belgium, 1988. Cited in [1, 2].
7. R. S. DEMBO AND T. STEIHAUG, Truncated-Newton algorithms for large-scale unconstrained optimization, Math. Programming, 26 (1983), pp. 190-212.
8. J. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Series in Computational Mathematics, Prentice-Hall, Englewood Cliffs, NJ, 1983. Reprinted by Society for Industrial and Applied Mathematics, Philadelphia, PA, 1996.
9. R. FLETCHER, An optimal positive definite update for sparse Hessian matrices, Numerical Analysis NA/145, Technical report, University of Dundee, 1992. Cited in [1, 2].
10. T. GIBSON, D. O'LEARY, AND L. NAZARETH, L-BFGS with Variations home page, http://www.cs.umd.edu/users/oleary/LBFGS/index.html (1996).
11. P. E. GILL AND W. MURRAY, Conjugate-gradient methods for large-scale nonlinear optimization, Tech. Report SOL 79-15, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1979.
12. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.
13. N. GOULD, Private communication to authors of [3], 1989. Cited in [1, 2].
14. A. GRIEWANK AND P. L. TOINT, Partitioned variable metric updates for large structured optimization problems, Numer. Math., 39 (1982), pp. 119-137.
15. H. KHALFAN, R. BYRD, AND R. SCHNABEL, A theoretical and experimental study of the symmetric rank one update, Tech. Report CU-CS-489-90, Department of Computer Science, University of Colorado at Boulder, 1990.
16. D. C. LIU AND J. NOCEDAL, On the limited memory BFGS method for large scale optimization, Math. Programming, 45 (1989), pp. 503-528.
17. D. G. LUENBERGER, Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, Reading, MA, 1984.
18. J. J. MORÉ, B. S. GARBOW, AND K. E. HILLSTROM, Testing unconstrained optimization software, ACM Trans. Math. Software, 7 (1981), pp. 17-41.
19. S. NASH, Newton-type minimization via the Lanczos process, SIAM J. Numer. Anal., 21 (1984), pp. 770-788.
20. S. G. NASH AND J. NOCEDAL, A numerical study of the limited memory BFGS method and the truncated-Newton method for large scale optimization, SIAM J. Optim., 1 (1991), pp. 358-372.
21. L. NAZARETH, A relationship between BFGS and conjugate gradient algorithms and its implications for new algorithms, SIAM J. Numer. Anal., 16 (1979), pp. 794-800.
22. L. NAZARETH, On the BFGS Method, unpublished manuscript, University of California at Berkeley, Berkeley, CA, 1981.
23. J. NOCEDAL, Updating quasi-Newton matrices with limited storage, Math. Comp., 35 (1980), pp. 773-782.
24. J. NOCEDAL, Theory of algorithms for unconstrained optimization, in Acta Numerica (1991), Cambridge University Press, London, 1992, pp. 199-242.
25. D. P. O'LEARY, A discrete Newton algorithm for minimizing a function of many variables, Math. Programming, 23 (1982), pp. 20-33.
26. S. OREN, Self-scaling variable metric algorithms, Part II: Implementation and experiments, Management Science, 20 (1974), pp. 863-874. Cited in [1, 2].
27. M. J. D. POWELL, Quadratic termination properties of minimization algorithms I: Statement and discussion of results, J. Inst. Math. Appl., 10 (1972), pp. 333-342.
28. D. F. SHANNO, Conjugate gradient methods with inexact line searches, Math. Oper. Res., 3 (1978), pp. 244-256.
29. P. TOINT, Some numerical results using a sparse matrix updating formula in unconstrained optimization, Math. Comput., 32 (1978), pp. 839-852.
30. P. TOINT, Test problems for partially separable optimization and results for the routine PSP-MIN, Tech. Report 83/4, Department of Mathematics, FUNDP, Namur, Belgium, 1983. Cited in [1, 2].