Algorithm 778: L-BFGS-B

書誌事項

タイトル別名
  • Fortran subroutines for large-scale bound-constrained optimization

この論文をさがす

説明

<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>

収録刊行物

被引用文献 (42)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ