Haskell binding to L-BFGS-B version 3.0 http://people.ksp.sk/~ivan/hlbfgsb

Latest on Hackage:

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Ivan Labáth
Maintained by ivan@hlbfgsb.ksp.sk

Haskell bindings to Nocedal's 3.0 version of the Limited memory - Broyden Fletcher Goldfarb Shanno - Bounded optimization algorithm.

Initial version, but functional. So far no support for limiting iteration count. A more powerful interface should be developed.

Notice: The fortran code is marked pure, althugh it tends to write to standard output at troubled times (should be fixed at some point in time).

From homepage: Software for Large-scale Bound-constrained Optimization L-BFGS-B is a limited-memory quasi-Newton code for bound-constrained optimization, i.e. for problems where the only constraints are of the form l <= x <= u. The current release is version 3.0. The distribution file was last changed on 2011-08-02.

Depends on:
Used by 1 package:
comments powered byDisqus