[R] Tackling of convergence issues in gamlss vs glm2
bgunter@4567 @end|ng |rom gm@||@com
Thu May 10 19:06:54 CEST 2018
If you do not receive a satisfactory reply to this rather technical
question -- this list is *mainly* about R programming -- you might try
directly emailing the maintainer: ?maintainer. This assumes of course that
you have thoroughly read package documentation + checked any of its listed
references (which I have obviously not).
You might also check the package code, though this often leads to C code
resources, which is kinda tough.
"The trouble with having an open mind is that people keep coming along and
sticking things into it."
-- Opus (aka Berkeley Breathed in his "Bloom County" comic strip )
On Thu, May 10, 2018 at 9:40 AM, Nik Tuzov <ntuzov using beacon.partek.com> wrote:
> I'd like to know how and if the GLM convergence problems are addressed in
> For simplicity, let's focus on Normal and Negative Binomial with log link.
> The convergence issues of the glm() function were alleviated in 2011 when
> glm2 package was released.
> Package gamlss was released in 2012, so it might still use the glm-like
> solution or call glm() directly.
> Is that the case or the improvements from glm2 have been incorporated into
> gamlss also?
> R-help using r-project.org mailing list -- To UNSUBSCRIBE and more, see
> PLEASE do read the posting guide http://www.R-project.org/
> and provide commented, minimal, self-contained, reproducible code.
[[alternative HTML version deleted]]
More information about the R-help