L-BFGS 
L-BFGS (Low-memory Broyden–Fletcher–Goldfarb–Shanno) is a library for doing
estimation and application of Hessians in numerical optimization while using
limited memory and never explicitly creating the Hessian. Only simple vector
operation are used, as specified by the L-BFGS algorithm.
The specific L-BFGS algorithm implemented here can be found in Algorithm 9.1 (L-BFGS two-loop recursion).
Moreover, the condition for the Cautious-BFGS (C-BFGS) algorithm, specified in D.-H. Li and M. Fukushima, "On the global convergence of the BFGS method for nonconvex unconstrained optimization problems", is used to check the updates of the L-BFGS.
Active WIP.
License
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.