lbfgs (1.2.1)

0 users

Limited-memory BFGS Optimization.

A wrapper built around the libLBFGS optimization library by Naoaki Okazaki. The lbfgs package implements both the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) and the Orthant-Wise Quasi-Newton Limited-Memory (OWL-QN) optimization algorithms. The L-BFGS algorithm solves the problem of minimizing an objective, given its gradient, by iteratively computing approximations of the inverse Hessian matrix. The OWL-QN algorithm finds the optimum of an objective plus the L1-norm of the problem's parameters. The package offers a fast and memory-efficient implementation of these optimization routines, which is particularly suited for high-dimensional problems.

Maintainer: Antonio Coppola
Author(s): Antonio Coppola [aut, cre, cph], Brandon Stewart [aut, cph], Naoaki Okazaki [aut, cph], David Ardia [ctb, cph], Dirk Eddelbuettel [ctb, cph], Katharine Mullen [ctb, cph], Jorge Nocedal [ctb, cph]

License: GPL (>= 2)

Uses: Rcpp
Reverse suggests: nlmixr, optimx, PlackettLuce, regsem, ROI.plugin.optimx, xtune

Released over 5 years ago.



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of lbfgs yet. Want to be the first? Write one now.

Related packages: DEoptim, LowRankQP, TSP, boot, bvls, clue, desirability, gafit, genalg, glpk, gsl, igraph, kernlab, linprog, lpSolve, minpack.lm, nls2, nnls, optmatch, powell(20 best matches, based on common tags.)

Search for lbfgs on google, google scholar, r-help, r-devel.

Visit lbfgs on R Graphical Manual.