Thanks for this good idea !
Arnaud
2012/5/1 Ted Harding
> On 01-May-2012 19:58:41 Arnaud Mosnier wrote:
> > Dear UseRs,
> >
> > Is there a way to define the lower-upper bounds for parameters
> > fitted by optim using the Nelder-Mead method ?
> >
> > Thanks,
> > Arnaud
>
> The Nelder-Mead method
Ben Bolker gmail.com> writes:
>
> 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
wlandres.net> writes:
>
> On 01-May-2012 19:58:41 Arnaud Mosnier wrote:
> > Dear UseRs,
> >
> > Is there a way to define the lower-upper bounds for parameters
> > fitted by optim using the Nelder-Mead method ?
> >
> > Thanks,
> > Arnaud
>
> The Nelder-Mead method does not provide built-in ca
On 01-May-2012 19:58:41 Arnaud Mosnier wrote:
> Dear UseRs,
>
> Is there a way to define the lower-upper bounds for parameters
> fitted by optim using the Nelder-Mead method ?
>
> Thanks,
> Arnaud
The Nelder-Mead method does not provide built-in capability
to set bounds on the range of paramater
On Wed, May 2, 2012 at 7:58 AM, Arnaud Mosnier wrote:
> Dear UseRs,
>
> Is there a way to define the lower-upper bounds for parameters fitted by
> optim using the Nelder-Mead method ?
>
It depends a bit on whether it's plausible that the solution is on the
boundary. If not, simply returning Inf
Dear UseRs,
Is there a way to define the lower-upper bounds for parameters fitted by
optim using the Nelder-Mead method ?
Thanks,
Arnaud
[[alternative HTML version deleted]]
__
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/li
6 matches
Mail list logo