Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
From MaRDI portal
Recommendations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Ways to sparse representation: An overview
- Greed is Good: Algorithmic Results for Sparse Approximation
- Efficient block-coordinate descent algorithms for the group Lasso
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/15324430152748236
- A group bridge approach for variable selection
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Blockwise sparse regression
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Input selection and shrinkage in multiresponse linear regression
- Iteratively reweighted least squares minimization for sparse recovery
- Matching pursuits with time-frequency dictionaries
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Compressive Sensing
- Multitask Compressive Sensing
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- On the use of sparse signal decomposition in the analysis of multi-channel surface electromyograms
- One-step sparse estimates in nonconcave penalized likelihood models
- Pathwise coordinate optimization
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Regularization and Variable Selection Via the Elastic Net
- Robust Recovery of Signals From a Structured Union of Subspaces
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- SimpleMKL
- Sparse approximations in signal and image processing
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The Adaptive Lasso and Its Oracle Properties
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(11)- A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging
- Robust detection of neural spikes using sparse coding based features
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- A single gallery-based face recognition using extended joint sparse representation
- Simultaneous nonparametric regression in RADWT dictionaries
- Efficient block-coordinate descent algorithms for the group Lasso
- Group sparse RLS algorithms
- A generalized formulation for group selection via ADMM
- Iteratively reweighted group Lasso based on log-composite regularization
- Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
This page was built for publication: Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537241)
