Installation
About
This algorithm provides a numerical solution to the problem of unconstrained local minimization (or maximization). It is particularly suited for complex problems and more efficient than the Gauss-Newton-like algorithm when starting from points very far from the final minimum (or maximum). Each iteration is parallelized and convergence relies on a stringent stopping criterion based on the first and second derivatives. See Philipps et al, 2021 doi:10.32614/RJ-2021-089.
Bug report | File report |
Key Metrics
Downloads
Yesterday | 54 0% |
Last 7 days | 601 -7% |
Last 30 days | 2.232 +8% |
Last 90 days | 6.384 -34% |
Last 365 days | 27.320 +57% |