Package dev.nm.solver.multivariate.unconstrained.c2

Local minimization of real-valued multivariate objectives.

See: Description

Interface Summary

Interface	Description
IterativeC2Maximizer.Solution
IterativeC2Minimizer	This is a minimizer that minimizes a twice continuously differentiable, multivariate function.

Class Summary

Class	Description
IterativeC2Maximizer	A maximization problem is simply minimizing the negative of the objective function.
NelderMeadMinimizer	The Nelder-Mead method is a nonlinear optimization technique, which is well-defined for twice differentiable and unimodal problems.

Package dev.nm.solver.multivariate.unconstrained.c2 Description

Local minimization of real-valued multivariate objectives.

NelderMeadMinimizer demonstrates the problem, solution, and search lifecycle without requiring analytic derivatives. Use C2OptimProblemImpl to supply a function and, when needed, its gradient and Hessian. Initial points and function domain dimensions must agree. A local search does not guarantee a global minimum.