Class FibonaccMinimizer.Solution
- java.lang.Object
-
- dev.nm.root.univariate.bracketsearch.BracketSearchMinimizer.Solution
-
- dev.nm.root.univariate.bracketsearch.FibonaccMinimizer.Solution
-
- All Implemented Interfaces:
UnivariateMinimizer.Solution,MinimizationSolution<Double>
- Enclosing class:
- FibonaccMinimizer
public class FibonaccMinimizer.Solution extends BracketSearchMinimizer.Solution
This is the solution to a Fibonacci's univariate optimization.
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected booleanisMinFound()This algorithm stops only after a pre-specified number of iterations.doublesearch(double lower, double upper)Search for a minimum within the interval [lower, upper].doublesearch(double lower, double initial, double upper)Search for a minimum within the interval [lower, upper].protected doublexnext()Compute the next best estimate within the bracketing interval.-
Methods inherited from class dev.nm.root.univariate.bracketsearch.BracketSearchMinimizer.Solution
init, isBracketing, minimizer, minimum, updateStates
-
-
-
-
Method Detail
-
search
public double search(double lower, double initial, double upper)Description copied from interface:UnivariateMinimizer.SolutionSearch for a minimum within the interval [lower, upper].- Specified by:
searchin interfaceUnivariateMinimizer.Solution- Overrides:
searchin classBracketSearchMinimizer.Solution- Parameters:
lower- the lower bound for the bracketing interval which contains a minimuminitial- an initial guessupper- the upper bound for the bracketing interval which contains a minimum- Returns:
- an approximate minimizer
-
search
public double search(double lower, double upper)Description copied from interface:UnivariateMinimizer.SolutionSearch for a minimum within the interval [lower, upper].- Parameters:
lower- the lower bound for the bracketing interval which contains a minimumupper- the upper bound for the bracketing interval which contains a minimum- Returns:
- an approximate minimizer
-
isMinFound
protected boolean isMinFound()
This algorithm stops only after a pre-specified number of iterations. This is to guarantee the search interval is reduced to certain size, or a fraction of the input interval.- Specified by:
isMinFoundin classBracketSearchMinimizer.Solution- Returns:
- false
-
xnext
protected double xnext()
Description copied from class:BracketSearchMinimizer.SolutionCompute the next best estimate within the bracketing interval. A particular univariate minimization algorithm implements the logic in this method.- Specified by:
xnextin classBracketSearchMinimizer.Solution- Returns:
- the next best guess of the minimizer
-
-