Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewton Classes and Interfaces - 7 results found.
NameDescriptionTypePackageFramework
BFGSMinimizerThe Broyden-Fletcher-Goldfarb-Shanno method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
DFPMinimizerThe Davidon-Fletcher-Powell method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
HuangMinimizerHuang's updating formula is a family of formulas which encompasses the rank-one, DFP, BFGS as well as some other formulas.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
McCormickMinimizerThis is the McCormick method.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
PearsonMinimizerThis is the Pearson method.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
QuasiNewtonMinimizerThe Quasi-Newton methods in optimization are for finding local maxima and minima of functions.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu
RankOneMinimizerThe Rank One method is a quasi-Newton method to solve unconstrained nonlinear optimization problems.Classcom.numericalmethod.suanshu.optimization.multivariate.unconstrained.c2.quasinewtonSuanShu