Class "NelderMead" of Nelder-Mead optimizers and its Generator
"NelderMead" is a reference class for a Nelder-Mead
simplex optimizer allowing box constraints on the parameters and using
NelderMead() function conveniently generates such objects.
Argument list (see Note below).
NelderMead$new(lower, upper, xst, x0, xt)Create a
All reference classes extend and inherit methods from
This is the default optimizer for the second stage of
nlmer fits. We
found that it was more reliable and often faster than
more sophisticated optimizers.
NelderMead() and the
new method must
be named arguments:
numeric vector of lower bounds - elements may be
numeric vector of upper bounds - elements may be
numeric vector of initial step sizes to establish the simplex - all elements must be non-zero.
numeric vector of starting values for the parameters.
numeric vector of tolerances on the parameters.
Based on code in the NLopt collection.
Nelder_Mead, the typical “constructor”.
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.