A Greedy Algorithm for Sparse Precision Matrix Approximation
From MaRDI portal
Publication:5079528
DOI10.4208/jcm.2005-m2019-0151OpenAlexW3192642995MaRDI QIDQ5079528
Publication date: 27 May 2022
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00723
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- A unified primal-dual algorithm framework based on Bregman iteration
- Covariance regularization by thresholding
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsistency and rates of convergence in large covariance matrix estimation
- Sparse permutation invariant covariance estimation
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Network exploration via the adaptive LASSO and SCAD penalties
- Nonlinear inverse scale space methods
- Nonparametric estimation of large covariance matrices of longitudinal data
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Fast sparse reconstruction: Greedy inverse scale space flows
- Model selection and estimation in the Gaussian graphical model
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- First-Order Methods for Sparse Covariance Selection
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Matching pursuits with time-frequency dictionaries
- An adaptive inverse scale space method for compressed sensing
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
This page was built for publication: A Greedy Algorithm for Sparse Precision Matrix Approximation