Perl extension for L-BFGS

L-BFGS (Limited-memory Broyden-Fletcher-Goldfarb-Shanno) is a quasi-Newton method for unconstrained optimization. This method is especially efficient on problems involving a large number of variables. Generally, it solves a problem described as following: min f(x), x = (x1, x2, ..., xn) Jorge Nocedal wrote a Fortran 77 version of this algorithm. <a href=""></a> And, Naoaki Okazaki rewrote it in pure C (liblbfgs). <a href=""></a> This module is a Perl port of Naoaki Okazaki's C version.

There is no official package available for openSUSE Leap 15.3


openSUSE Tumbleweed