Please do not reply directly to this email. All additional comments should be made in the comments box of this bug.
Summary: Review Request: levmar - Levenberg-Marquardt nonlinear least squares optimization
https://bugzilla.redhat.com/show_bug.cgi?id=558061
Summary: Review Request: levmar - Levenberg-Marquardt nonlinear least squares optimization Product: Fedora Version: rawhide Platform: All OS/Version: Linux Status: NEW Severity: medium Priority: medium Component: Package Review AssignedTo: nobody@fedoraproject.org ReportedBy: eric@brouhaha.com QAContact: extras-qa@fedoraproject.org CC: notting@redhat.com, fedora-package-review@redhat.com Estimated Hours: 0.0 Classification: Fedora
This is my first package, so I'm seeking a sponsor.
Spec URL: http://www.brouhaha.com/~eric/software/fedora/f12/levmar/levmar.spec SRPM URL: http://www.brouhaha.com/~eric/software/fedora/f12/levmar/levmar-2.5-1.fc12.s... Description: 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.