Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
Author:
- 1 July 2011
- journal article
- review article
- Published by Elsevier in Signal Processing
- Vol. 91 (7) , 1505-1526
Abstract
No abstract availableKeywords
All Related Versions
This publication has 48 references indexed in Scilit:
- Iteratively reweighted least squares minimization for sparse recoveryCommunications on Pure and Applied Mathematics, 2009
- A group bridge approach for variable selectionBiometrika, 2009
- One-step sparse estimates in nonconcave penalized likelihood modelsThe Annals of Statistics, 2008
- The Adaptive Lasso and Its Oracle PropertiesJournal of the American Statistical Association, 2006
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- A Tutorial on MM AlgorithmsThe American Statistician, 2004
- Block Coordinate Relaxation Methods for Nonparametric Wavelet DenoisingJournal of Computational and Graphical Statistics, 2000
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993