Algorithm 778: L-BFGS-B

Bibliographic Information

Other Title
  • Fortran subroutines for large-scale bound-constrained optimization

Search this article

Description

<jats:p>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.</jats:p>

Journal

Citations (42)*help

See more

Details 詳細情報について

Report a problem

Back to top