com.numericalmethod.suanshu.optimization.unconstrained.steepestdescent
Class GaussNewton
java.lang.Object
com.numericalmethod.suanshu.optimization.unconstrained.steepestdescent.SteepestDescent
com.numericalmethod.suanshu.optimization.unconstrained.steepestdescent.GaussNewton
- All Implemented Interfaces:
- Minimizer, UnconstrainedMinimizer
public class GaussNewton
- extends SteepestDescent
The Gauss-Newton method is a steepest descent method to minimize a real vector function in the form:
f(x) = [f1(x) f2(x) ... fm(x)]'
The objective function is
F(x) = f' %*% f
- See Also:
| Fields inherited from class com.numericalmethod.suanshu.optimization.unconstrained.steepestdescent.SteepestDescent |
f, g, tol |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
GaussNewton
public GaussNewton()
getLineSearch
protected SteepestDescent.LineSearch getLineSearch()
- Specified by:
getLineSearch in class SteepestDescent
solve
public void solve(UnconstrainedProblem problem,
double tol)
- Specified by:
solve in interface UnconstrainedMinimizer- Overrides:
solve in class SteepestDescent
solve
public void solve(RealVectorFunction vf,
RntoMatrix J,
double tol)
- Construct an instance of GaussNewton to minimize a real vector function
f.
- Parameters:
vf - the real vector function to be minimizedJ - a function that computes the Jacobian of f for a given xtol - the convergence tolerance
solve
public void solve(RealVectorFunction vf,
double tol)
- Construct an instance of GaussNewton to minimize a real vector function
f.
The Jacobian is computed numerically.
- Parameters:
vf - the real vector function to be minimizedtol - the convergence tolerance
Copyright © 2011 Numerical Method Inc. Ltd. All Rights Reserved.