Algorithm 778: L-BFGS-B

doi:10.1145/279232.279236

Algorithm 778: L-BFGS-B

1997-12-01

0

OA

AI

DOI：10.1145/279232.279236

原文链接

原文求助

摘要

En 中文

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.

Algorithm 778: L-BFGS-B

摘要

期刊

机构

引用论文