Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty

DOI10.1007/s10463-011-0333-xzbMath1254.62021arXiv0901.0017OpenAlexW2006002490MaRDI QIDQ1926006

Stéphane Chrétien, Hervé Perdry, Alfred O. III Hero

Publication date: 27 December 2012

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.0017

zbMATH Keywords

EM algorithmmaximum likelihood estimationmodel selectionsparsitynonsmooth penaltyspace alternating algorithm

Mathematics Subject Classification ID

Point estimation (62F10) Linear inference, regression (62J99)

Uses Software

• EBayesThresh

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-ideal model selection by \(\ell _{1}\) minimization
• Estimating the dimension of a model
• Convergence of a stochastic approximation version of the EM algorithm
• Variable selection for Cox's proportional hazards model and frailty model
• Needles and straw in haystacks: Empirical Bayes estimates of possibly sparse sequences
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Kullback proximal algorithms for maximum-likelihood estimation
• An EM algorithm for wavelet-based image restoration
• Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
• Variable Selection in Finite Mixture of Regression Models
• Monotone Operators and the Proximal Point Algorithm
• Parameter expansion to accelerate EM: the PX-EM algorithm
• 10.1162/15324430152748236
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Coupling a stochastic approximation version of EM with an MCMC procedure
• On EM algorithms and their proximal generalizations
• Convex Analysis