Uses of Class
gov.sandia.cognition.learning.algorithm.minimization.AbstractAnytimeFunctionMinimizer

Packages that use AbstractAnytimeFunctionMinimizer

Package	Description
gov.sandia.cognition.learning.algorithm.minimization	Provides minimization algorithms.
gov.sandia.cognition.learning.algorithm.minimization.line	Provides line (scalar) minimization algorithms.

Uses of AbstractAnytimeFunctionMinimizer in gov.sandia.cognition.learning.algorithm.minimization

Subclasses of AbstractAnytimeFunctionMinimizer in gov.sandia.cognition.learning.algorithm.minimization

Modifier and Type	Class and Description
class	FunctionMinimizerBFGS Implementation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) Quasi-Newton nonlinear minimization algorithm.
class	FunctionMinimizerConjugateGradient Conjugate gradient method is a class of algorithms for finding the unconstrained local minimum of a nonlinear function.
class	FunctionMinimizerDFP Implementation of the Davidon-Fletcher-Powell (DFP) formula for a Quasi-Newton minimization update.
class	FunctionMinimizerDirectionSetPowell Implementation of the derivative-free unconstrained nonlinear direction-set minimization algorithm called "Powell's Method" by Numerical Recipes.
class	FunctionMinimizerFletcherReeves This is an implementation of the Fletcher-Reeves conjugate gradient minimization procedure.
class	FunctionMinimizerGradientDescent This is an implementation of the classic Gradient Descent algorithm, also known as Steepest Descent, Backpropagation (for neural nets), or Hill Climbing.
class	FunctionMinimizerLiuStorey This is an implementation of the Liu-Storey conjugate gradient minimization procedure.
class	FunctionMinimizerNelderMead Implementation of the Downhill Simplex minimization algorithm, also known as the Nelder-Mead method.
class	FunctionMinimizerPolakRibiere This is an implementation of the Polack-Ribiere conjugate gradient minimization procedure.
class	FunctionMinimizerQuasiNewton This is an abstract implementation of the Quasi-Newton minimization method, sometimes called "Variable-Metric methods." This family of minimization algorithms uses first-order gradient information to find a locally minimum to a scalar function.

Uses of AbstractAnytimeFunctionMinimizer in gov.sandia.cognition.learning.algorithm.minimization.line

Subclasses of AbstractAnytimeFunctionMinimizer in gov.sandia.cognition.learning.algorithm.minimization.line

Modifier and Type	Class and Description
class	AbstractAnytimeLineMinimizer<EvaluatorType extends Evaluator<java.lang.Double,java.lang.Double>> Partial AnytimeAlgorithm implementation of a LineMinimizer.
class	LineMinimizerBacktracking Implementation of the backtracking line-minimization algorithm.
class	LineMinimizerDerivativeBased This is an implementation of a line-minimization algorithm proposed by Fletcher that makes extensive use of first-order derivative information.
class	LineMinimizerDerivativeFree This is an implementation of a LineMinimizer that does not require derivative information.