Skip to content

Numerical optimization solvers for unconstrained and simple-bounds constrained convex optimization problems in Rust

Notifications You must be signed in to change notification settings

fedemagnani/optimization-solvers

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Optimization-Solvers

Numerical optimization solvers for unconstrained and simple bound-constrained optimization problems. The solvers are implemented in Rust and are based on the ACM Collected Algorithms. The solvers are designed to be easy to use and to be easily integrated into existing codebases.

Note: Currently the unique non-rust solver is L-BFGS-B, which uses code bindings to the original Fortran implementation.

Quadratic In the figure above: minimization of quadratic function using gradient descent solver

Todo

Links

Books and articles:

About

Numerical optimization solvers for unconstrained and simple-bounds constrained convex optimization problems in Rust

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published