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 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 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 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 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 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.
-