The lower bound method in probit regression

Computational Statistics and Data Analysis

Volumn 30, Issue 1, 1999, Pages 13-17

  Böhning, Dankmar ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Generalized linear model; Lower bound method; Probit link function and probit regression; Quadratic approximation of log likelihood

Indexed keywords

APPROXIMATION THEORY; ITERATIVE METHODS; MATRIX ALGEBRA;

HESSIAN MATRIX; LOG-LIKELIHOOD; LOWER BOUND METHOD; PROBIT REGRESSION;

REGRESSION ANALYSIS;

EID: 0033098944     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9473(98)00094-2     Document Type: Article

References (7)

1. Böhning D. Likelihood inference for mixtures: geometrical and other constructions of monotone step-length algorithms. Biometrika. 76:1989;375-383.
2. Böhning D. Multinomial logistic regression algorithm. Ann. Inst. Statist. Math. 44:1992;197-200.
3. Böhning, D., 1993. Construction of reliable maximum likelihood algorithms with application to logistic and Cox regression. In: Rao, C.R. (Ed.), Handbook of Statistics, vol. 9. North-Holland, Amsterdam, pp. 409-422.
4. Böhning D., Lindsay B.G. Monotonicity of quadratic approximation algorithms. Ann. Inst. Statist. Math. 40:1988;641-663.
5. Dempster A.P., Laird N.M., Rubin D.B. Maximum likelihood estimation from incomplete data via the EM algorithm (with discussion). J. Roy. Statist. Soc. B. 39:1977;1-38.
6. Devidas, M., George, E.O., 1995. Monotonic algorithms for computing maximum likelihood estimates in generalized linear models. Preprint, Division of Biostatistics, University of Mississipi Medical Center.
7. McCullagh, P., Nelder, J.A., 1989. Generalized Linear Models, 2nd ed. Chapman & Hall, London.