Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms

DOI10.1016/J.SIGPRO.2011.01.012zbMATH Open1213.94044OpenAlexW2144059227MaRDI QIDQ537241FDOQ537241

Authors: Alain Rakotomamonjy 

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

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

zbMATH Keywords

group lassoblock-sparse regressioniterative reweighted algorithmssimultaneous sparse approximation

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• The Adaptive Lasso and Its Oracle Properties
• Pathwise coordinate optimization
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence of a block coordinate descent method for nondifferentiable minimization
• One-step sparse estimates in nonconcave penalized likelihood models
• Atomic Decomposition by Basis Pursuit
• Regularization and Variable Selection Via the Elastic Net
• Model Selection and Estimation in Regression with Grouped Variables
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• 10.1162/15324430152748236
• Matching pursuits with time-frequency dictionaries
• A group bridge approach for variable selection
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Input selection and shrinkage in multiresponse linear regression
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• 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\)
• SimpleMKL
• Iteratively reweighted least squares minimization for sparse recovery
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Title not available (Why is that?)
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Blockwise sparse regression
• Model-Based Compressive Sensing
• A sparse signal reconstruction perspective for source localization with sensor arrays
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Multitask Compressive Sensing
• Robust Recovery of Signals From a Structured Union of Subspaces
• An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
• Why Simple Shrinkage Is Still Relevant for Redundant Representations?
• Sparse approximations in signal and image processing
• On the use of sparse signal decomposition in the analysis of multi-channel surface electromyograms

Cited In (11)

• Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
• Simultaneous nonparametric regression in RADWT dictionaries
• Group sparse RLS algorithms
• A generalized formulation for group selection via ADMM
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• A single gallery-based face recognition using extended joint sparse representation
• Iteratively reweighted group Lasso based on log-composite regularization
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• 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
• Efficient block-coordinate descent algorithms for the group Lasso

Uses Software

• SeDuMi
• PDCO
• CoSaMP
• SimpleMKL

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)