Uses of Interface
dev.nm.solver.multivariate.unconstrained.IterativeMinimizer
-
-
Uses of IterativeMinimizer in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim that implement IterativeMinimizer Modifier and Type Class Description class
DEOptim
Differential Evolution (DE) is a global optimization method. -
Uses of IterativeMinimizer in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local with type parameters of type IterativeMinimizer Modifier and Type Class Description class
LocalSearchCellFactory<P extends OptimProblem,T extends IterativeMinimizer<OptimProblem>>
static interface
LocalSearchCellFactory.MinimizerFactory<U extends IterativeMinimizer<OptimProblem>>
This factory constructs a newMinimizer
for each mutation operation.Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local that implement IterativeMinimizer Modifier and Type Class Description class
GlobalSearchByLocalMinimizer
This minimizer is a global optimization method. -
Uses of IterativeMinimizer in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid that implement IterativeMinimizer Modifier and Type Class Description class
SimpleGridMinimizer
This minimizer is a simple global optimization method. -
Uses of IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.annealing
Classes in dev.nm.solver.multivariate.unconstrained.annealing that implement IterativeMinimizer Modifier and Type Class Description class
GeneralizedSimulatedAnnealingMinimizer
Tsallis and Stariolo (1996) proposed this variant ofSimulatedAnnealingMinimizer
(SA).class
SimulatedAnnealingMinimizer
Simulated Annealing is a global optimization meta-heuristic that is inspired by annealing in metallurgy. -
Uses of IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.c2
Subinterfaces of IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.c2 Modifier and Type Interface Description interface
IterativeC2Minimizer
This is a minimizer that minimizes a twice continuously differentiable, multivariate function.Classes in dev.nm.solver.multivariate.unconstrained.c2 that implement IterativeMinimizer Modifier and Type Class Description class
NelderMeadMinimizer
The Nelder-Mead method is a nonlinear optimization technique, which is well-defined for twice differentiable and unimodal problems. -
Uses of IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection
Classes in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection that implement IterativeMinimizer 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 IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.c2.quasinewton
Classes in dev.nm.solver.multivariate.unconstrained.c2.quasinewton that implement IterativeMinimizer 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 IterativeMinimizer in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent
Classes in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent that implement IterativeMinimizer 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.class
SteepestDescentMinimizer
A steepest descent algorithm finds the minimum by moving along the negative of the steepest gradient direction.
-