Levenberg-Marquardt nonlinear least squares algorithm
levmar is a native ANSI C implementation of the Levenberg-Marquardt optimization algorithm. Both unconstrained and constrained (under linear equations, inequality and box constraints) Levenberg-Marquardt variants are included. The LM algorithm is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. When the current solution is far from the correct on, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge. When the current solution is close to the correct solution, it becomes a Gauss-Newton method.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 2.6-15.fc40 | - |
Fedora 40 | 2.6-15.fc40 | - |
Fedora 39 | 2.6-13.fc39 | - |
Fedora 38 | 2.6-12.fc38 | - |
EPEL 8 | 2.6-3.el8 | - |
EPEL 7 | 2.6-1.el7 | - |
You can contact the maintainers of this package via email at
levmar dash maintainers at fedoraproject dot org
.