The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Computational Methods for Sparse Solution of Linear Inverse Problems
Abstract
The goal of the sparse approximation problem is to approximate a target signal using a linear combination of a few elementary signals drawn from a fixed collection. This paper surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circumstances in which individual methods tend to perform well, and to the theoretical guarantees available. Many fundamental questions in electrical engineering, statistics, and applied mathematics can be posed as sparse approximation problems, making these algorithms versatile and relevant to a plethora of applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Self-citationEfron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Self-citationPati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Self-citationIntroductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Self-citationOptimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Advances in Neural Information Processing Systems 20
Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008) · neural information processing systems · Cited by 2,701
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
Friedman, J. H., & Stuetzle, W. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477729 · Cited by 2,216
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064
Uncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
Self-citationSparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Subset Selection in Regression
(2003) · Technometrics · doi:10.1198/tech.2003.s144 · Cited by 1,463
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019604 · Cited by 1,433
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Self-citationAlgorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
Self-citationProblem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Model-Based Compressive Sensing
Baraniuk, R. G., Cevher, V., Duarte, M. F., & Hegde, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2040894 · Cited by 1,308
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Compressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Subset Selection in Regression
Miller, A. (2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035933 · Cited by 929
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
11-magic : Recovery of sparse signals via convex programming
Candès, E. J. (2005) · Medical Entomology and Zoology · Cited by 725
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000002 · Cited by 718
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Foucart, S., & Lai, M.-J. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.09.001 · Cited by 715
Problem Complexity and Method Efficiency in Optimization
Darzentas, J., Nemirovsky, A., & Yudin, D. B. (1984) · Journal of the Operational Research Society · doi:10.2307/2581380 · Cited by 650
Projected Newton Methods for Optimization Problems with Simple Constraints
Bertsekas, D. P. (1982) · SIAM Journal on Control and Optimization · doi:10.1137/0320018 · Cited by 613
Some remarks on greedy algorithms
DeVore, R., & Temlyakov, V. N. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124742 · Cited by 573
On Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Bayesian Compressive Sensing Via Belief Propagation
Baron, D., Sarvotham, S., & Baraniuk, R. G. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027773 · Cited by 498
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2008) · Cited by 469
Redundant Multiscale Transforms and Their Application for Morphological Component Separation
Starck, J.-L., Elad, M., & Donoho, D. (2004) · Advances in Imaging and Electron Physics · doi:10.1016/s1076-5670(04)32006-9 · Cited by 443
Data compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
Guaranteed Rank Minimization via Singular Value Projection
Jain, P., Meka, R., & Dhillon, I. S. (2010) · Cited by 420
ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATIONPreprint
Tropp, J. A. (2006) · Cited by 350
Self-citationApproximation and learning by greedy algorithms
Barron, A. R., Cohen, A., Dahmen, W., & DeVore, R. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000631 · Cited by 305
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2009) · The Annals of Statistics · doi:10.1214/08-aos653 · Cited by 302
Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
Maleki, A., & Donoho, D. L. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039176 · Cited by 289
Wen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090747695 · Cited by 280
Linear convergence of iterative soft-thresholdingPreprint
Bredies, K., & Lorenz, D. A. (2012) · Cited by 265
On the conditioning of random subdictionaries
Tropp, J. A. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.09.001 · Cited by 212
Self-citationHighly sparse representations from dictionaries are unique and independent of the sparseness measure
Gribonval, R., & Nielsen, M. (2007) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.09.003 · Cited by 185
Approximation of functions over redundant dictionaries using coherence
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. J. (2003) · doi:10.5555/644108.644149 · Cited by 183
On the Consistency of Feature Selection using Greedy Least Squares Regression
Zhang, T. (2009) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/1577069.1577088 · Cited by 182
Garg, R., & Khandekar, R. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553417 · Cited by 161
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Bredies, K., & Lorenz, D. A. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/060663556 · Cited by 140
Sparco: A Testing Framework for Sparse Reconstruction
van den Berg, E., Friedlander, M. P., Hennenfent, G., Herrmann, F. J., Saab, R., & Ylmaz, O. (2007) · Cited by 85
Norms of random submatrices and sparse approximation
Tropp, J. A. (2008) · Comptes Rendus Mathématique · doi:10.1016/j.crma.2008.10.008 · Cited by 81
Self-citationFast Bayesian Matching Pursuit: Model Uncertainty and Parameter Estimation for Sparse Linear Models
Schniter, P., & Ziniel, J. (2009) · Cited by 59
LASSO-Patternsearch algorithm with application to ophthalmology and genomic data
Klein, R., Klein, R., Lee, K., Shi, W., Wahba, G., & Wright, S. J. (2008) · Statistics and Its Interface · doi:10.4310/sii.2008.v1.n1.a12 · Cited by 43
Self-citationOn Theory of Compressive Sensing via L_1-Minimization: Simple Derivations and Extensions
Zhang, Y. (2008) · Rice Research Repository (Rice University) · Cited by 32
Cited by
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Sparse representation or collaborative representation: Which helps face recognition?
Zhang, L., Yang, M., & Feng, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126277 · Cited by 1,952
Sparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Nonlocally Centralized Sparse Representation for Image Restoration
Dong, W., Zhang, L., Shi, G., & Li, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235847 · Cited by 1,505
Hyperspectral Image Classification Using Dictionary-Based Sparse Representation
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2129595 · Cited by 1,155
Metadata
- Authors
- Tropp, J. A., & Wright, S. J.
- Venue
- Proceedings of the IEEE
- Published
- 2010-06
- Volume
- 98
- Issue
- 6
- Pages
- 948-958
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2118297240
- Cited by
- 1,046
- References
- 81
- FWCI
- 90.32
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.