Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound-Constrained Optimization

ACM Transactions on Mathematical Software

Volumn 23, Issue 4, 1997, Pages 550-560

  Zhu, Ciyou ^b   Byrd, Richard H ^a,c   Lu, Peihuang ^b   Nocedal, Jorge ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b Northwestern University   (United States)

^c University of Colorado at Boulder   (United States)

Author keywords

Algorithms; D.3.2 Programming Languages : Language Classifications Fortran 77; G.1.6 Numerical Analysis : Optimization Gradient methods; G.4 Mathematics of Computing : Mathematical Software; Large scale optimization; Limited memory method

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; FORTRAN (PROGRAMMING LANGUAGE); MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

LIMITED MEMORY METHODS; VARIABLE METRIC METHODS;

SUBROUTINES;

EID: 0031345518     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/279232.279236     Document Type: Article

References (17)

1. BERTSEKAS, D. P. 1982. Projected Newton methods for optimization problems with simple constraints. SIAM J. Contr. Optim. 20, 221-246.
2. BONGARTZ, I., CONN, A. R., GOULD, N., AND TOINT, PH. L. 1995. CUTE: Constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 1 (Mar.), 123-160.
3. BUCKLEY, A. 1989. Remark on Algorithm 630. ACM Trans. Math. Softw. 15, 3 (Sept.), 262-274.
4. BUCKLEY, A. AND LENIR, A. 1985. ALGORITHM 630: BBVSCG - a variable-storage algorithm for function minimization. ACM Trans. Math. Softw. 11, 2 (June), 103-119.
5. BYRD, R. H., LU, P., NOCEDAL, J., AND ZHU, C. 1995. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 5 (Sept.), 1190-1208.
6. BYRD, R. H., NOCEDAL, J., AND SCHNABEL, R. B. 1994. Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 2 (Jan. 31), 129-156.
7. CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 1988. Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comput. 50, 182, 399-430.
8. CONN, A. R., GOULD, N. I. M., AND TOINT, PH. L. 1992. LANCELOT: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics, vol. 17. Springer-Verlag, New York, NY.
9. DENNIS, J. E. AND SCHNABEL, R. B. 1983. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Inc., Upper Saddle River, NJ.
10. GILBERT, J. C. AND LEMARÉCHAL, C. 1989. Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45, 3 (Dec.), 407-435.
11. GILL, P. E., MURRAY, W., AND WRIGHT, M. H. 1981. Practical Optimization. Academic Press Ltd., London, UK.
12. LEVITIN, E. S. AND POLYAK, B. T. 1966. Constrained minimization problems. USSR Comput. Math. Math. Phys. 6, 1-50.
13. LIU, D. C. AND NOCEDAL, J. 1989. On the limited memory BFGS method for large scale optimization. Math. Program. 45, 3 (Dec.), 503-528.
14. MORÉ, J. J. AND THUENTE, D. J. 1994. Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20, 3 (Sept.), 286-307.
15. MORÉ, J. J. AND TORALDO, G. 1989. Algorithms for bound constrained quadratic programming problems. Numer. Math. 55, 377-400.
16. SIEGEL, D. 1992. Implementing and modifying Broyden class updates for large scale optimization. Rep. DAMPT 1992/NA12. Cambridge University, Cambridge, MA.
17. ZHU, C., BYRD, R. H., LU, P., AND NOCEDAL, J. 1995. L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. EECS Tech. Rep. NAM12. Northwestern University, Evanston, IL.