Class FibonaccMinimizer
- java.lang.Object
-
- dev.nm.root.univariate.bracketsearch.BracketSearchMinimizer
-
- dev.nm.root.univariate.bracketsearch.FibonaccMinimizer
-
- All Implemented Interfaces:
UnivariateMinimizer
,Minimizer<C2OptimProblem,UnivariateMinimizer.Solution>
,Optimizer<C2OptimProblem,UnivariateMinimizer.Solution>
public class FibonaccMinimizer extends BracketSearchMinimizer
The Fibonacci search is a dichotomous search where a bracketing interval is sub-divided by the Fibonacci ratio. This implementation runs the risk that the next guess may lie outside the bracketing interval.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description class
FibonaccMinimizer.Solution
This is the solution to a Fibonacci's univariate optimization.
-
Field Summary
-
Fields inherited from class dev.nm.root.univariate.bracketsearch.BracketSearchMinimizer
epsilon, maxIterations
-
-
Constructor Summary
Constructors Constructor Description FibonaccMinimizer(double epsilon, int maxIterations)
Construct a univariate minimizer using the Fibonacci method.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description FibonaccMinimizer.Solution
solve(C2OptimProblem problem)
Solve an optimization problem, e.g.,OptimProblem
.-
Methods inherited from class dev.nm.root.univariate.bracketsearch.BracketSearchMinimizer
solve
-
-
-
-
Method Detail
-
solve
public FibonaccMinimizer.Solution solve(C2OptimProblem problem)
Description copied from interface:Optimizer
Solve an optimization problem, e.g.,OptimProblem
.- Parameters:
problem
- an optimization problem- Returns:
- a solution to the optimization problem
-
-