Skip to content
Prev 59885 / 398502 Next

Error using glm with poisson family and identity link

On 26-Nov-04 Prof Brian Ripley wrote:
I've had success with awkward constrained optimisation using the
Nelder-Mead procedure -- simply make the region beyond the constraint
hot enough for the simplex to recoil on touching it.

I once tested it in what I thought might be a tough case by
planting "trees" all over a shallow quadratic bowl. More
precisely, many circular regions which were not to be entered.
The objective was to locate the minimum of the bowl.

The function was defined so as to take a high value inside
each circular region.

The simplex took a long time to locate the minimum, spending
a lot of the time feeling its way slowly round the "trunks"
of the "trees", and some of the time trotting downhill over
open space, but it did get there. Nelder-Mead is pretty robust.

Best wishes to all,
Ted.


--------------------------------------------------------------------
E-Mail: (Ted Harding) <Ted.Harding at nessie.mcc.ac.uk>
Fax-to-email: +44 (0)870 094 0861  [NB: New number!]
Date: 26-Nov-04                                       Time: 09:39:08
------------------------------ XFMail ------------------------------