It is my pleasure to announce a new release of lbfgs, a binding to Nocedal’s implementation of the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm using a limited amount of computer memory with the possibility of setting bounds on the variables. The purpose of this algorithm is to solve large-scale nonlinear optimization problems. Here are some elementary examples of use. I hope you will find this library useful.
Related topics
Topic | Replies | Views | Activity | |
---|---|---|---|---|
[ANN] OCANNL 0.3.1: a from-scratch deep learning (i.e. dense tensor optimization) framework | 15 | 867 | April 24, 2024 | |
[ANN] RFSM version 2.0 | 0 | 354 | December 15, 2023 | |
[ANN] Release of optiml-transport | 3 | 789 | July 6, 2022 | |
[BLOG] Flambda2 Ep. 2: Loopifying Tail-Recursive Functions, by OCamlPro | 3 | 456 | June 10, 2024 | |
New Owl book: Architecture of Advanced Numerical Analysis Systems | 10 | 2093 | February 19, 2024 |