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. (Source:

References in zbMATH (referenced in 313 articles , 1 standard article )

Showing results 21 to 40 of 313.
Sorted by year (citations)

previous 1 2 3 4 ... 14 15 16 next

  1. Zhang, Shanglong; Gain, Arun L.; Norato, Julián A.: Adaptive mesh refinement for topology optimization with discrete geometric components (2020)
  2. Bachoc, François; Bevilacqua, Moreno; Velandia, Daira: Composite likelihood estimation for a Gaussian process under fixed domain asymptotics (2019)
  3. Becker, Stephen; Fadili, Jalal; Ochs, Peter: On quasi-Newton forward-backward splitting: proximal calculus and convergence (2019)
  4. Boggs, Paul T.; Byrd, Richard H.: Adaptive, limited-memory BFGS algorithms for unconstrained optimization (2019)
  5. Bolancé, Catalina; Vernic, Raluca: Multivariate count data generalized linear models: three approaches based on the Sarmanov distribution (2019)
  6. Brust, Johannes; Burdakov, Oleg; Erway, Jennifer B.; Marcia, Roummel F.: A dense initialization for limited-memory quasi-Newton methods (2019)
  7. Creamer, Germán G.; Lee, Chihoon: A multivariate distance nonlinear causality test based on partial distance correlation: a machine learning application to energy futures (2019)
  8. Debarnot, Valentin; Kahn, Jonas; Weiss, Pierre: Multiview attenuation estimation and correction (2019)
  9. Di Gangi, Leonardo; Lapucci, M.; Schoen, F.; Sortino, A.: An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series (2019)
  10. Fercoq, Olivier; Bianchi, Pascal: A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions (2019)
  11. Gong, Gail; Wang, Wei; Hsieh, Chih-Lin; Van Den Berg, David J.; Haiman, Christopher; Oakley-Girvan, Ingrid; Whittemore, Alice S.: Data-adaptive multi-locus association testing in subjects with arbitrary genealogical relationships (2019)
  12. Gronski, Jessica; Ben Sassi, Mohamed-Amin; Becker, Stephen; Sankaranarayanan, Sriram: Template polyhedra and bilinear optimization (2019)
  13. Józsa, Tamas I.; Balaras, E.; Kashtalyan, M.; Borthwick, A. G. L.; Viola, I. M.: Active and passive in-plane wall fluctuations in turbulent channel flows (2019)
  14. Keshavarz, Hossein; Nguyen, XuanLong; Scott, Clayton: Local inversion-free estimation of spatial Gaussian processes (2019)
  15. Keskar, N.; Wächter, Andreas: A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (2019)
  16. Kimiaei, Morteza; Rahpeymaii, Farzad: Impulse noise removal by an adaptive trust-region method (2019)
  17. Kirschstein, Thomas; Liebscher, Steffen; Pandolfo, Giuseppe; Porzio, Giovanni C.; Ragozini, Giancarlo: On finite-sample robustness of directional location estimators (2019)
  18. Kürschner, Patrick; Dolgov, Sergey; Harris, Kameron Decker; Benner, Peter: Greedy low-rank algorithm for spatial connectome regression (2019)
  19. Le Coz, Sebastian; Cheptou, Pierre-Olivier; Peyrard, Nathalie: A spatial Markovian framework for estimating regional and local dynamics of annual plants with dormancy (2019)
  20. Lee, Ching-pei; Wright, Stephen J.: Inexact successive quadratic approximation for regularized optimization (2019)

previous 1 2 3 4 ... 14 15 16 next