org.apache.commons.math3.fitting.leastsquares package
(cf. MATH-1008).@Deprecated public class LevenbergMarquardtOptimizer extends AbstractLeastSquaresOptimizer
optimize will throw
MathUnsupportedOperationException if bounds are passed to it.
This implementation should work even for over-determined systems (i.e. systems having more point than equations). Over-determined systems are solved by ignoring the point which have the smallest impact according to their jacobian column norm. Only the rank of the matrix and some loop bounds are changed to implement this.
The resolution engine is a simple translation of the MINPACK lmder routine with minor changes. The changes include the over-determined resolution, the use of inherited convergence checker and the Q.R. decomposition which has been rewritten following the algorithm described in the P. Lascaux and R. Theodor book Analyse numérique matricielle appliquée à l'art de l'ingénieur, Masson 1986.
The authors of the original fortran version are:
| Minpack Copyright Notice (1999) University of Chicago. All rights reserved |
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
|
evaluations, iterations| Constructor and Description |
|---|
LevenbergMarquardtOptimizer()
Deprecated.
Build an optimizer for least squares problems with default values
for all the tuning parameters (see the
other contructor. |
LevenbergMarquardtOptimizer(ConvergenceChecker<PointVectorValuePair> checker)
Deprecated.
Constructor that allows the specification of a custom convergence
checker.
|
LevenbergMarquardtOptimizer(double initialStepBoundFactor,
ConvergenceChecker<PointVectorValuePair> checker,
double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance,
double threshold)
Deprecated.
Constructor that allows the specification of a custom convergence
checker, in addition to the standard ones.
|
LevenbergMarquardtOptimizer(double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance)
Deprecated.
Build an optimizer for least squares problems with default values
for some of the tuning parameters (see the
other contructor. |
LevenbergMarquardtOptimizer(double initialStepBoundFactor,
double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance,
double threshold)
Deprecated.
The arguments control the behaviour of the default convergence checking
procedure.
|
| Modifier and Type | Method and Description |
|---|---|
protected PointVectorValuePair |
doOptimize()
Deprecated.
Performs the bulk of the optimization algorithm.
|
computeCost, computeCovariances, computeResiduals, computeSigma, computeWeightedJacobian, getChiSquare, getRMS, getWeightSquareRoot, optimize, parseOptimizationData, setCostcomputeJacobiancomputeObjectiveValue, getTarget, getTargetSize, getWeightgetLowerBound, getStartPoint, getUpperBoundgetConvergenceChecker, getEvaluations, getIterations, getMaxEvaluations, getMaxIterations, incrementEvaluationCount, incrementIterationCount, optimizepublic LevenbergMarquardtOptimizer()
other contructor.
The default values for the algorithm settings are:
Precision.SAFE_MINpublic LevenbergMarquardtOptimizer(ConvergenceChecker<PointVectorValuePair> checker)
Precision.SAFE_MINchecker - Convergence checker.public LevenbergMarquardtOptimizer(double initialStepBoundFactor,
ConvergenceChecker<PointVectorValuePair> checker,
double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance,
double threshold)
initialStepBoundFactor - Positive input variable used in
determining the initial step bound. This bound is set to the
product of initialStepBoundFactor and the euclidean norm of
diag * x if non-zero, or else to initialStepBoundFactor
itself. In most cases factor should lie in the interval
(0.1, 100.0). 100 is a generally recommended value.checker - Convergence checker.costRelativeTolerance - Desired relative error in the sum of
squares.parRelativeTolerance - Desired relative error in the approximate
solution parameters.orthoTolerance - Desired max cosine on the orthogonality between
the function vector and the columns of the Jacobian.threshold - Desired threshold for QR ranking. If the squared norm
of a column vector is smaller or equal to this threshold during QR
decomposition, it is considered to be a zero vector and hence the rank
of the matrix is reduced.public LevenbergMarquardtOptimizer(double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance)
other contructor.
The default values for the algorithm settings are:
Precision.SAFE_MINcostRelativeTolerance - Desired relative error in the sum of
squares.parRelativeTolerance - Desired relative error in the approximate
solution parameters.orthoTolerance - Desired max cosine on the orthogonality between
the function vector and the columns of the Jacobian.public LevenbergMarquardtOptimizer(double initialStepBoundFactor,
double costRelativeTolerance,
double parRelativeTolerance,
double orthoTolerance,
double threshold)
ConvergenceChecker.initialStepBoundFactor - Positive input variable used in
determining the initial step bound. This bound is set to the
product of initialStepBoundFactor and the euclidean norm of
diag * x if non-zero, or else to initialStepBoundFactor
itself. In most cases factor should lie in the interval
(0.1, 100.0). 100 is a generally recommended value.costRelativeTolerance - Desired relative error in the sum of
squares.parRelativeTolerance - Desired relative error in the approximate
solution parameters.orthoTolerance - Desired max cosine on the orthogonality between
the function vector and the columns of the Jacobian.threshold - Desired threshold for QR ranking. If the squared norm
of a column vector is smaller or equal to this threshold during QR
decomposition, it is considered to be a zero vector and hence the rank
of the matrix is reduced.protected PointVectorValuePair doOptimize()
doOptimize in class BaseOptimizer<PointVectorValuePair>Copyright © 2003–2016 The Apache Software Foundation. All rights reserved.