public class FibonaccMinimizer.Solution extends BracketSearchMinimizer.Solution
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
isMinFound()
This algorithm stops only after a pre-specified number of iterations.
|
double |
search(double lower,
double upper)
Search for a minimum within the interval [lower, upper].
|
double |
search(double lower,
double initial,
double upper)
Search for a minimum within the interval [lower, upper].
|
protected double |
xnext()
Compute the next best estimate within the bracketing interval.
|
init, isBracketing, minimizer, minimum, updateStatespublic double search(double lower,
double initial,
double upper)
UnivariateMinimizer.Solutionsearch in interface UnivariateMinimizer.Solutionsearch in class BracketSearchMinimizer.Solutionlower - the lower bound for the bracketing interval which contains a minimuminitial - an initial guessupper - the upper bound for the bracketing interval which contains a minimumpublic double search(double lower,
double upper)
UnivariateMinimizer.Solutionlower - the lower bound for the bracketing interval which contains a minimumupper - the upper bound for the bracketing interval which contains a minimumprotected boolean isMinFound()
isMinFound in class BracketSearchMinimizer.Solutionprotected double xnext()
BracketSearchMinimizer.Solutionxnext in class BracketSearchMinimizer.SolutionCopyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.