1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
Source: libalgorithm-lbfgs-perl
Section: perl
Priority: optional
Maintainer: Debian Perl Group <pkg-perl-maintainers@lists.alioth.debian.org>
Uploaders: Dima Kogan <dima@secretsauce.net>
Build-Depends: debhelper (>= 9.20120312),
perl,
libtest-number-delta-perl,
libtest-pod-perl,
liblbfgs-dev
Standards-Version: 3.9.6
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-perl/packages/libalgorithm-lbfgs-perl.git
Vcs-Git: git://anonscm.debian.org/pkg-perl/packages/libalgorithm-lbfgs-perl.git
Homepage: https://metacpan.org/release/Algorithm-LBFGS
Testsuite: autopkgtest-pkg-perl
Package: libalgorithm-lbfgs-perl
Architecture: any
Depends: ${misc:Depends}, ${perl:Depends}, ${shlibs:Depends}
Description: Perl interface to an L-BFGS non-linear optimization algorithm
Algorithm::LBFGS is an interface to liblbfgs, a C implementation of 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)
|
