Package org.hipparchus.optim.univariate
Class BrentOptimizer
java.lang.Object
org.hipparchus.optim.BaseOptimizer<UnivariatePointValuePair>
org.hipparchus.optim.univariate.UnivariateOptimizer
org.hipparchus.optim.univariate.BrentOptimizer
For a function defined on some interval
This code is an adaptation, partly based on the Python code from SciPy (module "optimize.py" v0.5); the original algorithm is also modified
(lo, hi)
, this class
finds an approximation x
to the point at which the function
attains its minimum.
It implements Richard Brent's algorithm (from his book "Algorithms for
Minimization without Derivatives", p. 79) for finding minima of real
univariate functions.
This code is an adaptation, partly based on the Python code from SciPy (module "optimize.py" v0.5); the original algorithm is also modified
- to use an initial guess provided by the user,
- to ensure that the best point encountered is the one returned.
-
Field Summary
Fields inherited from class org.hipparchus.optim.BaseOptimizer
evaluations, iterations
-
Constructor Summary
ConstructorDescriptionBrentOptimizer
(double rel, double abs) The arguments are used for implementing the original stopping criterion of Brent's algorithm.BrentOptimizer
(double rel, double abs, ConvergenceChecker<UnivariatePointValuePair> checker) The arguments are used implement the original stopping criterion of Brent's algorithm. -
Method Summary
Modifier and TypeMethodDescriptionprotected UnivariatePointValuePair
Performs the bulk of the optimization algorithm.Methods inherited from class org.hipparchus.optim.univariate.UnivariateOptimizer
computeObjectiveValue, getGoalType, getMax, getMin, getStartValue, optimize, parseOptimizationData
Methods inherited from class org.hipparchus.optim.BaseOptimizer
getConvergenceChecker, getEvaluations, getIterations, getMaxEvaluations, getMaxIterations, incrementEvaluationCount, incrementIterationCount, optimize
-
Constructor Details
-
BrentOptimizer
The arguments are used implement the original stopping criterion of Brent's algorithm.abs
andrel
define a tolerancetol = rel |x| + abs
.rel
should be no smaller than 2 macheps and preferably not much less than sqrt(macheps), where macheps is the relative machine precision.abs
must be positive.- Parameters:
rel
- Relative threshold.abs
- Absolute threshold.checker
- Additional, user-defined, convergence checking procedure.- Throws:
MathIllegalArgumentException
- ifabs <= 0
.MathIllegalArgumentException
- ifrel < 2 * FastMath.ulp(1d)
.
-
BrentOptimizer
public BrentOptimizer(double rel, double abs) The arguments are used for implementing the original stopping criterion of Brent's algorithm.abs
andrel
define a tolerancetol = rel |x| + abs
.rel
should be no smaller than 2 macheps and preferably not much less than sqrt(macheps), where macheps is the relative machine precision.abs
must be positive.- Parameters:
rel
- Relative threshold.abs
- Absolute threshold.- Throws:
MathIllegalArgumentException
- ifabs <= 0
.MathIllegalArgumentException
- ifrel < 2 * FastMath.ulp(1d)
.
-
-
Method Details
-
doOptimize
Performs the bulk of the optimization algorithm.- Specified by:
doOptimize
in classBaseOptimizer<UnivariatePointValuePair>
- Returns:
- the point/value pair giving the optimal value of the objective function.
-