Package org.hipparchus.optim.univariate

package org.hipparchus.optim.univariate

One-dimensional optimization algorithms.

Related Packages

Package	Description
org.hipparchus.optim	Generally, optimizers are algorithms that will either minimize or maximize a scalar function, called the objective function.
org.hipparchus.optim.linear	Optimization algorithms for linear constrained problems.

Classes

Class	Description
BracketFinder	Provide an interval that brackets a local optimum of a function.
BrentOptimizer	For a function defined on some interval (lo, hi), this class finds an approximation x to the point at which the function attains its minimum.
MultiStartUnivariateOptimizer	Special implementation of the UnivariateOptimizer interface adding multi-start features to an existing optimizer.
SearchInterval	Search interval and (optional) start value.
SimpleUnivariateValueChecker	Simple implementation of the ConvergenceChecker interface that uses only objective function values.
UnivariateObjectiveFunction	Scalar function to be optimized.
UnivariateOptimizer	Base class for a univariate scalar function optimizer.
UnivariatePointValuePair	This class holds a point and the value of an objective function at this point.