Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Zhu et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: