cmaes
iproute
| cmaes | iproute | |
|---|---|---|
| 3 | 1 | |
| 30 | 46 | |
| - | - | |
| 0.0 | 4.5 | |
| almost 2 years ago | 3 months ago | |
| Rust | Haskell | |
| Apache License 2.0 | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
cmaes
-
[ANN] cmaes v0.2.0: An implementation of the CMA-ES optimization algorithm
cmaes is an implementation of the CMA-ES black box numerical optimization algorithm. It's especially suited to solving high-dimension, non-linear, non-convex, ill-conditioned, and/or noisy problems.
- [ANN] cmaes 0.1: An implementation of the CMA-ES optimization algorithm
-
Looking for an efficient algorithm that will test out a huge array set and return the maximum solution
If your function is truly black box then you can use a black box optimization algorithms (note that they likely will not be as good since they make less asumptions on the problem) such as the one provided by argmin or my own simplers_optimization (amongst others). The CMA-ES algorithm has a very good reputation for those use cases but I only found one implementation in Rust and it is not on crates.io.
iproute
What are some alternatives?
argmin - Numerical optimization in pure Rust
binary-search - Binary and exponential searches
ersatz - A monad for interfacing with external SAT solvers
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
pell - Haskell Package to solve the Generalized Pell Equation
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
Peroxide - Rust numeric library with R, MATLAB & Python syntax
lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
keyboard_layout_optimizer - A keyboard layout optimizer supporting multiple layers. Implemented in Rust.
twentyseven - Rubik's cube solver in Haskell
aeson-diff - Generate and apply diffs between JSON documents.
ADPfusionSet - dynamic programming for set data structures