Algorithm 778: L-BFGS-B
Ciyou Zhu, Richard H. Byrd, Peihuang Lu et al. · ACM Transactions on Mathematical Software · 1997
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.
Cited by 3,462 works. doi:10.1145/279232.279236 Open-access PDF
Authors
References
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations
- On the limited memory BFGS method for large scale optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- Constrained minimization methods
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
- Some numerical experiments with variable-storage quasi-Newton algorithms
- CUTE
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
- Representations of quasi-Newton matrices and their use in limited memory methods