L-BFGS-B

Algorithm 778: L-BFGS-B Fortran subroutines for large-scale bound-constrained optimization. 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 predecessor, algorithm L-BFGS (Harwell routine VA15). The algorithm is implemened in Fortran 77.


References in zbMATH (referenced in 152 articles )

Showing results 61 to 80 of 152.
Sorted by year (citations)
  1. Lockwood, Brian; Mavriplis, Dimitri: Gradient-based methods for uncertainty quantification in hypersonic flows (2013)
  2. Shen, Chunhua; Li, Hanxi; van den Hengel, Anton: Fully corrective boosting with arbitrary loss and regularization (2013)
  3. Birgin, Ernesto G.; Gentil, Jan M.: Evaluating bound-constrained minimization software (2012)
  4. Birgin, Ernesto G.; Martínez, J. M.: Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (2012)
  5. Cioaca, Alexandru; Alexe, Mihai; Sandu, Adrian: Second-order adjoints for solving PDE-constrained optimization problems (2012)
  6. Hansen, Hallstein Asheim; Schneider, Gerardo; Steffen, Martin: Reachability analysis of non-linear planar autonomous systems (2012)
  7. Lessig, C.; de Witt, T.; Fiume, E.: Efficient and accurate rotation of finite spherical harmonics expansions (2012)
  8. Nickisch, Hannes: Glm-ie: generalised linear models inference & estimation toolbox (2012) ioport
  9. Tacheny, N.; Troestler, C.: A mountain pass algorithm with projector (2012)
  10. Benešová, Barbora: Global optimization numerical strategies for rate-independent processes (2011)
  11. Byrd, Richard H.; Waltz, Richard A.: An active-set algorithm for nonlinear programming using parametric linear programming (2011)
  12. Egidi, N.; Maponi, P.: Residual correction techniques for the efficient solution of inverse scattering problems (2011)
  13. Morales, José Luis; Nocedal, Jorge: Remark on “Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization” (2011)
  14. Piacentini, M.; Rinaldi, F.: Path loss prediction in urban environment using learning machines and dimensionality reduction techniques (2011)
  15. Qian, Dong; Phadke, Manas; Karpov, Eduard; Liu, Wing Kam: A domain-reduction approach to bridging-scale simulation of one-dimensional nanostructures (2011)
  16. Rachowicz, W.; Zdunek, A.: Application of the FEM with adaptivity for electromagnetic inverse medium scattering problems (2011)
  17. Xiao, Yun-Hai; Hu, Qing-Jie; Wei, Zengxin: Modified active set projected spectral gradient method for bound constrained optimization (2011)
  18. Yuan, Gonglin; Lu, Xiwen: An active set limited memory BFGS algorithm for bound constrained optimization (2011)
  19. Yu, Guangxu; Müller, Jens-Dominik; Jones, Dominic; Christakopoulos, Faidon: CAD-based shape optimisation using adjoint sensitivities (2011)
  20. Zhu, Wenxing; Lin, Geng: A dynamic convexized method for nonconvex mixed integer nonlinear programming (2011)