ADMM algorithmic regularization paths for high-dimensional sparse precision matrix estimation
From MaRDI portal
Recommendations
- An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Fast algorithms for sparse inverse covariance estimation
- ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning
- A Greedy Algorithm for Sparse Precision Matrix Approximation
Cited in
(8)- An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data
- ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning
- LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM
- Block-diagonal precision matrix regularization for ultra-high dimensional data
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions
This page was built for publication: ADMM algorithmic regularization paths for high-dimensional sparse precision matrix estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996441)
