levmar: An implementation of the Levenberg-Marquardt algorithm
The Levenberg-Marquardt 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 one, 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.
Optional box- and linear constraints can be given. Both single and double precision floating point types are supported.
The actual algorithm is implemented in a
C library which is
bindings-levmar which this package depends on.
A note regarding the license:
This library depends on
bindings-levmar which is bundled together
with a C library which falls under the GPL. Please be aware of this
when distributing programs linked with this library. For details see
the description and license of
[Skip to Readme]
|Versions [RSS]||0.1, 0.2, 0.2.1, 0.3, 1.0, 1.1, 126.96.36.199, 1.2, 188.8.131.52, 1.2.1, 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206, 220.127.116.11|
|Dependencies||base (>=3 && <5), bindings-levmar (>=1.1), hmatrix (>=0.12), vector (>=0.8) [details]|
|Copyright||(c) 2009 - 2014 Roel van Dijk & Bas van Dijk|
|Author||Roel van Dijk <email@example.com> Bas van Dijk <firstname.lastname@example.org>|
|Maintainer||Roel van Dijk <email@example.com> Bas van Dijk <firstname.lastname@example.org>|
|Source repo||head: git clone git://github.com/basvandijk/levmar.git|
|Uploaded||by BasVanDijk at 2018-05-07T06:39:40Z|
|Downloads||13058 total (26 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2018-05-07 [all 1 reports]