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 classDEOptimDifferential 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 classLocalSearchCellFactory<P extends OptimProblem,T extends IterativeMinimizer<OptimProblem>>static interfaceLocalSearchCellFactory.MinimizerFactory<U extends IterativeMinimizer<OptimProblem>>This factory constructs a newMinimizerfor each mutation operation.Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local that implement IterativeMinimizer Modifier and Type Class Description classGlobalSearchByLocalMinimizerThis 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 classSimpleGridMinimizerThis 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 classGeneralizedSimulatedAnnealingMinimizerTsallis and Stariolo (1996) proposed this variant ofSimulatedAnnealingMinimizer(SA).classSimulatedAnnealingMinimizerSimulated 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 interfaceIterativeC2MinimizerThis 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 classNelderMeadMinimizerThe 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 classConjugateGradientMinimizerA conjugate direction optimization method is performed by using sequential line search along directions that bear a strict mathematical relationship to one another.classFletcherReevesMinimizerThe Fletcher-Reeves method is a variant of the Conjugate-Gradient method.classPowellMinimizerPowell's algorithm, starting from an initial point, performs a series of line searches in one iteration.classZangwillMinimizerZangwill'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 classBFGSMinimizerThe Broyden-Fletcher-Goldfarb-Shanno method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.classDFPMinimizerThe Davidon-Fletcher-Powell method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.classHuangMinimizerHuang's updating formula is a family of formulas which encompasses the rank-one, DFP, BFGS as well as some other formulas.classMcCormickMinimizerDeprecated.the McCormick algorithm does not seem to work well; need further investigation; don't use it.classPearsonMinimizerThis is the Pearson method.classQuasiNewtonMinimizerThe Quasi-Newton methods in optimization are for finding local maxima and minima of functions.classRankOneMinimizerThe 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 classFirstOrderMinimizerThis implements the steepest descent line search using the first order expansion of the Taylor's series.protected static classGaussNewtonMinimizer.MySteepestDescentclassNewtonRaphsonMinimizerThe Newton-Raphson method is a second order steepest descent method that is based on the quadratic approximation of the Taylor series.classSteepestDescentMinimizerA steepest descent algorithm finds the minimum by moving along the negative of the steepest gradient direction.
-