Skip to content
Prev 293246 / 398502 Next
Original Raw

Define lower-upper bound for parameters in Optim using Nelder-Mead method

Ben Bolker 
<Ted.Harding <at> wlandres.net> writes:
In addition to these options, there is also a derivative-free
box-constrained optimizer (bobyqa) in the 'minqa' package (and in
an optim-like wrapper via the optimx package), and
a box-constrained Nelder-Mead optimizer in the development
(r-forge) version of lme4, which is based on the NLopt optimization
library (also accessible via the nloptr package).

Thread (6 messages)

Arnaud Mosnier Define lower-upper bound for parameters in Optim using Nelder-Mead method May 1 Thomas Lumley Define lower-upper bound for parameters in Optim using Nelder-Mead method May 1 (Ted Harding) Define lower-upper bound for parameters in Optim using Nelder-Mead method May 1 Ben Bolker Define lower-upper bound for parameters in Optim using Nelder-Mead method May 1 Hans W Borchers Define lower-upper bound for parameters in Optim using Nelder-Mead method May 2 Arnaud Mosnier Define lower-upper bound for parameters in Optim using Nelder-Mead method May 2