Algorithm 778: L-BFGS-B

Ciyou Zhu(Northwestern University), Richard H. Byrd(University of Colorado Boulder), Peihuang Lu(Northwestern University), Jorge Nocedal(Northwestern University)
ACM Transactions on Mathematical Software
December 1, 1997
Cited by 3,422Open Access
Full Text

Abstract

L-BFGS-B is a limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds on the variables. It is intended for problems in which information on the Hessian matrix is difficult to obtain, or for large dense problems. L-BFGS-B can also be used for unconstrained problems and in this case performs similarly to its predessor, algorithm L-BFGS (Harwell routine VA15). The algorithm is implemented in Fortran 77.


Related Papers

No related papers found

Powered by citation graph analysis