A proximal distance algorithm for likelihood-based sparse covariance estimation

DOI10.1093/BIOMET/ASAC011OpenAlexW4210909547WikidataQ115582920 ScholiaQ115582920MaRDI QIDQ5872849FDOQ5872849

Authors: Jason Xu, Kenneth Lange 

Publication date: 4 January 2023

Published in: Biometrika (Search for Journal in Brave)

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

Recommendations

• <formula formulatype="inline"><tex Notation="TeX">$l_{0}$</tex></formula> Sparse Inverse Covariance Estimation
• Sparse estimation of a covariance matrix
• Covariance estimation via sparse Kronecker structures
• A DC programming approach for sparse estimation of a covariance matrix
• Certifiably optimal sparse inverse covariance estimation
• Sparse and low-rank covariance matrix estimation
• Estimation of functionals of sparse covariance matrices
• Sparse covariance matrix estimation by DCA-based algorithms
• Fast algorithms for sparse inverse covariance estimation
• Sparse covariance estimation in heterogeneous samples

zbMATH Keywords

penalized likelihoodsparse estimationmajorization-minimizationproximal algorithmsequential unconstrained minimizationdistance-to-set penalty

Mathematics Subject Classification ID

Statistics (62-XX)

Cited In (2)

• The stochastic proximal distance algorithm
• Direct covariance matrix estimation with compositional data

This page was built for publication: A proximal distance algorithm for likelihood-based sparse covariance estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872849)