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

bfgs convex-optimization lbfgs optimization optimization-algorithms optimization-methods rust solver spg
3 Open Issues Need Help Last updated: Jul 2, 2025

Open Issues Need Help

View All on GitHub

AI Summary: Implement and present benchmarks comparing the performance of the Rust optimization solvers in this project against other existing crates. The benchmarks should be organized in a matrix format (problem x solver) within the README, along with a table comparing solver support across different crates.

Complexity: 4/5
good first issue bench

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

Rust
#bfgs#convex-optimization#lbfgs#optimization#optimization-algorithms#optimization-methods#rust#solver#spg
[test] add tests 2 months ago

AI Summary: Add comprehensive tests to each numerical solver within the Rust optimization library, including line search methods. This ensures the correctness and reliability of the implemented algorithms.

Complexity: 4/5
good first issue testing

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

Rust
#bfgs#convex-optimization#lbfgs#optimization#optimization-algorithms#optimization-methods#rust#solver#spg

AI Summary: The task is to add a code example for each optimization solver implemented in the Rust-based optimization library. Each example should demonstrate the solver's usage and functionality.

Complexity: 4/5
documentation good first issue

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

Rust
#bfgs#convex-optimization#lbfgs#optimization#optimization-algorithms#optimization-methods#rust#solver#spg