public class FletcherReeves extends ConjugateGradient
ConjugateGradient, it uses a line search.
The advantages are:
SteepestDescent.SteepestDescentImplepsilon, maxIterations| Constructor and Description |
|---|
FletcherReeves(double epsilon,
int maxIterations)
Construct a multivariate minimizer using the Fletcher-Reeves method.
|
| Modifier and Type | Method and Description |
|---|---|
IterativeMinimizer<Vector> |
solve(C2OptimProblem problem)
Solve a minimization problem with a C2 objective function.
|
public FletcherReeves(double epsilon,
int maxIterations)
epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0maxIterations - the maximum number of iterationspublic IterativeMinimizer<Vector> solve(C2OptimProblem problem) throws java.lang.Exception
SteepestDescentsolve in interface Optimizer<C2OptimProblem,IterativeMinimizer<Vector>>solve in class ConjugateGradientproblem - a minimization problem with a C2 objective functionjava.lang.Exception - when there is an error solving the problem