Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter
DOI10.1016/j.csda.2011.07.013zbMath1243.65021OpenAlexW1967949057MaRDI QIDQ425379
Guo-Liang Tian, Chunling Liu, Man-Lai Tang
Publication date: 8 June 2012
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2011.07.013
stabilityconvergencenumerical exampleslogistic regressionNewton-Raphson algorithmEM-type algorithmsCox proportional hazards modelshrinkage parameterFisher scoring algorithmoptimal QLB algorithmQLB algorithmquadratic lower-bound algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Acceleration of the EM algorithm using the vector epsilon algorithm
- A quasi-Newton acceleration for high-dimensional optimization algorithms
- Monotonicity of quadratic-approximation algorithms
- Accelerating the convergence of the EM algorithm using the vector \(\varepsilon \) algorithm
- Multinomial logistic regression algorithm
- Bootstrap methods: another look at the jackknife
- The lower bound method in probit regression.
- On the rate of convergence of the ECM algorithm
- Maximum likelihood estimation via the ECM algorithm: A general framework
- Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
- Fast EM-type Implementations for Mixed Effects Models
- Parameter expansion to accelerate EM: the PX-EM algorithm
- Numerical Analysis for Statisticians
- Numerical Optimization
- Conjugate Gradient Acceleration of the EM Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter
