×

zbMATH — the first resource for mathematics

maxLik: a package for maximum likelihood estimation in R. (English) Zbl 1304.65039
Summary: This paper describes the package maxLik for the statistical environment R. The package is essentially a unified wrapper interface to various optimization routines, offering easy access to likelihood-specific features like standard errors or information matrix equality (BHHH method). More advanced features of the optimization algorithms, such as forcing the value of a particular parameter to be fixed, are also supported.

MSC:
65C60 Computational problems in statistics (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ardia D, Mullen K (2010) DEoptim: global optimization by differential evolution. http://CRAN.R-project.org/package=DEoptim . R package version 2.0–4
[2] BĂ©lisle CJP (1992) Convergence theorems for a class of simulated annealing algorithms on Rd. J Appl Probab 29: 885–895 · Zbl 0765.65059
[3] Berndt EK, Hall BH, Hall RE, Hausman JA (1974) Estimation and inference in nonlinear structural models. Annalysis Soc Meas 3(4): 653–665
[4] Bolker B (2009) bbmle: Tools for general maximum likelihood estimation. http://CRAN.R-project.org/package=bbmle . R package version 0.9.3
[5] Broyden CG (1970) The convergence of a class of double-rank minimization algorithms. J Inst Math Appl 6: 76–90 · Zbl 0223.65023
[6] Calzolari G, Fiorentini G (1993) Alternative covariance estimators of the standard tobit model. Econ Lett 42(1): 5–13 · Zbl 0800.62770
[7] Carlevaro F, Croissant Y, Hoareau S (2010) mhurdle: estimation of models with limited dependent variables. R package version 0.1. http://CRAN.R-project.org/package=mhurdle
[8] Croissant Y (2009) truncreg: truncated regression models. http://CRAN.R-project.org/package=truncreg . R package version 0.1
[9] Croissant Y (2010) pglm: panel generalized linear model. R package version 0.1. http://CRAN.R-project.org/package=pglm
[10] Fletcher R (1970) A new approach to variable metric algorithms. Comput J 13: 317–322 · Zbl 0207.17402
[11] Gay DM (1990) Usage summary for selected optimization routines. Computing science technical report 153, AT&T Bell Laboratories. http://netlib.bell-labs.com/cm/cs/cstr/153.pdf
[12] Goldfarb D (1970) A family of variable metric updates derived by variational means. Math Comput 24: 23–26 · Zbl 0196.18002
[13] Greene WH (2008) Econometric analysis. 6. Prentice Hall, Englewood Cliffs
[14] Henningsen A (2010) censReg: censored regression (Tobit) models. R package version 0.5. http://CRAN.R-project.org/package=censReg
[15] Henningsen A, Toomet O (2010) miscTools: miscellanneous small tools and utilities. R package version 0.6. http://cran.r-project.org/package=miscTools
[16] Nelder JA, Mead R (1965) A simplex algorithm for function minimization. Comput J 7: 308–313 · Zbl 0229.65053
[17] Nielsen HB, Mortensen SB (2009) ucminf: general-purpose unconstrained non-linear optimization. http://CRAN.R-project.org/package=ucminf . R package version 1.0
[18] R Development Core Team (2009) R: A language and environment for statistical computing. R foundation for statistical computing. Vienna, Austria. http://www.R-project.org , ISBN 3-900051-07-0
[19] Sevcikova H, Raftery A (2010) mlogitBMA: Bayesian Model Averaging for Multinomial Logit Models. http://CRAN.R-project.org/package=mlogitBMA . R package version 0.1-2
[20] Shanno DF (1970) Conditioning of quasi-newton methods for function minimization. Math Comput 24: 647–656 · Zbl 0225.65073
[21] Toomet O, Henningsen A (2008) Sample selection models in R: package sampleSelection. J Stat Softw 27(7):1–23. http://www.jstatsoft.org/v27/i07/
[22] Toomet O, Henningsen A (2010) maxLik: tools for maximum likelihood estimation. R package version 1.0. http://CRAN.R-project.org/package=maxLik · Zbl 1304.65039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.