An algorithm that can be applied to a non-linear least squares problem.
The optimum found by the optimizer.
The data necessary to define a non-linear least squares problem.
An evaluation of a
A interface for functions that compute a vector of values and can compute their derivatives (Jacobian).
An implementation of
Gauss-Newton least-squares solver.
An adapter that delegates to another implementation of
A mutable builder for
A Factory for creating
This class solves a least-squares problem using the Levenberg-Marquardt algorithm.
The decomposition algorithm to use to solve the normal equations.
least-squares optimizersminimize the distance (called cost or χ2) between model and observations.
LeastSquaresProblem). Such a model predicts a set of values which the algorithm tries to match with a set of given set of observed values.
builderor it can be created at once using a
Copyright © 2003–2014 The Apache Software Foundation. All rights reserved.