Uses of Class
dev.nm.solver.multivariate.unconstrained.c2.steepestdescent.SteepestDescentMinimizer
-
-
Uses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection
Subclasses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection Modifier and Type Class Description class
ConjugateGradientMinimizer
A conjugate direction optimization method is performed by using sequential line search along directions that bear a strict mathematical relationship to one another.class
FletcherReevesMinimizer
The Fletcher-Reeves method is a variant of the Conjugate-Gradient method.class
PowellMinimizer
Powell's algorithm, starting from an initial point, performs a series of line searches in one iteration.class
ZangwillMinimizer
Zangwill's algorithm is an improved version of Powell's algorithm. -
Uses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.quasinewton
Subclasses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.quasinewton Modifier and Type Class Description class
BFGSMinimizer
The Broyden-Fletcher-Goldfarb-Shanno method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.class
DFPMinimizer
The Davidon-Fletcher-Powell method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.class
HuangMinimizer
Huang's updating formula is a family of formulas which encompasses the rank-one, DFP, BFGS as well as some other formulas.class
McCormickMinimizer
Deprecated.the McCormick algorithm does not seem to work well; need further investigation; don't use it.class
PearsonMinimizer
This is the Pearson method.class
QuasiNewtonMinimizer
The Quasi-Newton methods in optimization are for finding local maxima and minima of functions.class
RankOneMinimizer
The Rank One method is a quasi-Newton method to solve unconstrained nonlinear optimization problems. -
Uses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent
Subclasses of SteepestDescentMinimizer in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent Modifier and Type Class Description class
FirstOrderMinimizer
This implements the steepest descent line search using the first order expansion of the Taylor's series.protected static class
GaussNewtonMinimizer.MySteepestDescent
class
NewtonRaphsonMinimizer
The Newton-Raphson method is a second order steepest descent method that is based on the quadratic approximation of the Taylor series.
-