Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
From MaRDI portal
Publication:537241
DOI10.1016/j.sigpro.2011.01.012zbMath1213.94044OpenAlexW2144059227MaRDI QIDQ537241
Publication date: 19 May 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.01.012
Related Items
Efficient block-coordinate descent algorithms for the group Lasso, A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging, A single gallery-based face recognition using extended joint sparse representation, Simultaneous nonparametric regression in RADWT dictionaries, Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, Robust detection of neural spikes using sparse coding based features
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- One-step sparse estimates in nonconcave penalized likelihood models
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Input selection and shrinkage in multiresponse linear regression
- Sparse approximations in signal and image processing
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- On the use of sparse signal decomposition in the analysis of multi-channel surface electromyograms
- Pathwise coordinate optimization
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- A group bridge approach for variable selection
- Iteratively reweighted least squares minimization for sparse recovery
- Atomic Decomposition by Basis Pursuit
- 10.1162/15324430152748236
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Multitask Compressive Sensing
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Matching pursuits with time-frequency dictionaries
- Robust Recovery of Signals From a Structured Union of Subspaces
- Model-Based Compressive Sensing
- Regularization and Variable Selection Via the Elastic Net
- Sparse solutions to linear inverse problems with multiple measurement vectors
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Model Selection and Estimation in Regression with Grouped Variables
- Convergence of a block coordinate descent method for nondifferentiable minimization
