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 21 to 40 of 152.
Sorted by year (citations)

previous 1 2 3 4 ... 6 7 8 next

  1. Brauchart, Johann S.; Dragnev, Peter D.; Saff, Edward B.; Womersley, Robert S.: Logarithmic and Riesz equilibrium for multiple sources on the sphere: the exceptional case (2018)
  2. Keriven, Nicolas; Bourrier, Anthony; Gribonval, Rémi; Pérez, Patrick: Sketching for large-scale learning of mixture models (2018)
  3. Mei, Yue; Hurtado, Daniel E.; Pant, Sanjay; Aggarwal, Ankush: On improving the numerical convergence of highly nonlinear elasticity problems (2018)
  4. Mei, Yue; Yu, Peng: Mapping heterogeneous elastic property distribution of soft tissues using harmonic motion data: a theoretical study (2018)
  5. Michel, T.; Fehrenbach, J.; Lobjois, V.; Laurent, J.; Gomes, A.; Colin, T.; Poignard, Clair: Mathematical modeling of the proliferation gradient in multicellular tumor spheroids (2018)
  6. Moye, Matthew J.; Diekman, Casey O.: Data assimilation methods for neuronal state and parameter estimation (2018)
  7. Nguyen, Thi Nhat Anh; Bouzerdoum, Abdesselam; Phung, Son Lam: Stochastic variational hierarchical mixture of sparse Gaussian processes for regression (2018)
  8. Schmitz, Morgan A.; Heitz, Matthieu; Bonneel, Nicolas; Ngolè, Fred; Coeurjolly, David; Cuturi, Marco; Peyré, Gabriel; Starck, Jean-Luc: Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning (2018)
  9. Shikhar Bhardwaj, Ryan R. Curtin, Marcus Edel, Yannis Mentekidis, Conrad Sanderson: ensmallen: a flexible C++ library for efficient function optimization (2018) arXiv
  10. Jerker Nordh: pyParticleEst: A Python Framework for Particle-Based Estimation Methods (2017) not zbMATH
  11. Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems (2017)
  12. Rahimov, Anar; Litman, Amélie; Ferrand, Guillaume: MRI-based electric properties tomography with a quasi-Newton approach (2017)
  13. Zabinyako, Gerard Idelfonovich: Applications of quasi-Newton algorithms for solving large scale problems (2017)
  14. Csercsik, Dávid: Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade (2016)
  15. Long, Chengjiang; Hua, Gang; Kapoor, Ashish: A joint Gaussian process model for active visual recognition with expertise estimation in crowdsourcing (2016)
  16. Pawela, Łukasz; Sadowski, Przemysław: Various methods of optimizing control pulses for quantum systems with decoherence (2016)
  17. Wang, Peng; Shen, Chunhua; van den Hengel, Anton; Torr, Philip H. S.: Efficient semidefinite branch-and-cut for MAP-MRF inference (2016)
  18. Zahr, M. J.; Persson, P.-O.: An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems (2016)
  19. Zahr, M. J.; Persson, P.-O.; Wilkening, J.: A fully discrete adjoint method for optimization of flow problems on deforming domains with time-periodicity constraints (2016)
  20. Gallard, François; Mohammadi, Bijan; Montagnac, Marc; Meaux, Matthieu: An adaptive multipoint formulation for robust parametric optimization (2015)

previous 1 2 3 4 ... 6 7 8 next