Writing for the observed counts, independence of the Poisson distributions gives the log-likelihood
Its score function and negative second derivative are
Unless all vanish, , so the log-likelihood is strictly concave. Use Newton method, starting from a finite , with
Stop when the score function or the change in is small; a reduced step can ensure that the log-likelihood increases. Any finite zero of the score function is the unique maximum-likelihood estimator.
Existence needs a qualification. If the nonzero include both signs, decreases from to , so a finite root exists. If all nonzero are positive, a finite root exists exactly when ; otherwise the supremum is approached as . The corresponding condition for all negative is , with a supremum at otherwise. When all , the parameter is unidentifiable. These cases explain when the iterative algorithm actually has a finite estimate to find.

Articles by others on the same topic (0)

There are currently no matching articles.