levmar (math/levmar) Add to my watchlist

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.

Version: 2.6 License: GPL GitHub
Maintainers lockhart
Categories math
Homepage http://www.ics.forth.gr/~lourakis/levmar/
Platforms darwin
  • atlas (Use MacPorts' ATLAS instead of Accelerate Framework)
  • universal (Build for multiple architectures)

"levmar" depends on

lib (1)
build (1)

Ports that depend on "levmar"

No ports

Port Health:

Loading Port Health

Installations (30 days)


Requested Installations (30 days)