LBFGS-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. (Source: http://plato.asu.edu)


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

Showing results 1 to 20 of 174.
Sorted by year (citations)

1 2 3 ... 7 8 9 next

  1. Chen, Tianyi; Curtis, Frank E.; Robinson, Daniel P.: A reduced-space algorithm for minimizing $\ell_1$-regularized convex functions (2017)
  2. Karimi, Sahar; Vavasis, Stephen: IMRO: A proximal quasi-Newton method for solving $\ell_1$-regularized least squares problems (2017)
  3. Mao, Qi; Wang, Li; Tsang, Ivor W.: A unified probabilistic framework for robust manifold learning and embedding (2017)
  4. Métivier, L.; Brossier, R.; Operto, S.; Virieux, J.: Full waveform inversion and the truncated Newton method (2017)
  5. Owen, N.E.; Challenor, P.; Menon, P.P.; Bennani, S.: Comparison of surrogate-based uncertainty quantification methods for computationally expensive simulators (2017)
  6. Racine, Jeffrey S.; Li, Kevin: Nonparametric conditional quantile estimation: a locally weighted quantile kernel approach (2017)
  7. Stiegelmeier, Elenice W.; Oliveira, Vilma A.; Silva, Geraldo N.; Karam, Décio: Optimal weed population control using nonlinear programming (2017)
  8. Azzimonti, Dario; Bect, Julien; Chevalier, Clément; Ginsbourger, David: Quantifying uncertainties on excursion sets under a Gaussian random field prior (2016)
  9. Calandra, Roberto; Seyfarth, André; Peters, Jan; Deisenroth, Marc Peter: Bayesian optimization for learning gaits under uncertainty. An experimental comparison on a dynamic bipedal walker (2016) ioport
  10. Chen, Dai-Qiang; Zhou, Yan; Song, Li-Juan: Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring (2016)
  11. Comets, Francis; Falconnet, Mikael; Loukianov, Oleg; Loukianova, Dasha: Maximum likelihood estimator consistency for recurrent random walk in a parametric random environment with finite support (2016)
  12. Csercsik, Dávid: Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade (2016)
  13. De Lozzo, Matthias; Marrel, Amandine: Estimation of the derivative-based global sensitivity measures using a Gaussian process metamodel (2016)
  14. Dennis, Emily B.; Morgan, Byron J.T.; Freeman, Stephen N.; Roy, David B.; Brereton, Tom: Dynamic models for longitudinal butterfly data (2016)
  15. Han, Sung Won; Zhong, Hua: Estimation of sparse directed acyclic graphs for multivariate counts data (2016)
  16. Huang, Shi; MacKinnon, David P.; Perrino, Tatiana; Gallo, Carlos; Cruden, Gracelyn; Hendricks Brown, C.: A statistical method for synthesizing mediation analyses using the product of coefficient approach across multiple trials (2016)
  17. Keshavarz, Hossein; Scott, Clayton; Nguyen, XuanLong: On the consistency of inversion-free parameter estimation for Gaussian random fields (2016)
  18. Krislock, Nathan; Malick, Jér^ome; Roupin, Frédéric: Computational results of a semidefinite branch-and-bound algorithm for $k$-cluster (2016)
  19. Latouche, Pierre; Mattei, Pierre-Alexandre; Bouveyron, Charles; Chiquet, Julien: Combining a relaxed EM algorithm with Occam’s razor for Bayesian variable selection in high-dimensional regression (2016)
  20. Mérigot, Quentin; Mirebeau, Jean-Marie: Minimal geodesics along volume-preserving maps, through semidiscrete optimal transport (2016)

1 2 3 ... 7 8 9 next