The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Open accessAbstract
In this paper, we propose and study the use of alternating direction algorithms for several $\ell_1$-norm minimization problems arising from sparse solution recovery in compressive sensing, including the basis pursuit problem, the basis pursuit denoising problems of both unconstrained and constrained forms, and others. We present and investigate two classes of algorithms derived from either the primal or the dual form of $\ell_1$-problems. The construction of the algorithms consists of two main steps: (1) to reformulate an $\ell_1$-problem into one having blockwise separable objective functions by adding new variables and constraints; and (2) to apply an exact or inexact alternating direction method to the augmented Lagrangian function of the resulting problem. The derived alternating direction algorithms can be regarded as first-order primal-dual algorithms because both primal and dual variables are updated at every iteration. Convergence properties of these algorithms are established or restated when they already exist. Extensive numerical experiments are performed, using randomized partial Walsh–Hadamard sensing matrices, to demonstrate the versatility and effectiveness of the proposed approach. Moreover, we present numerical results to emphasize two practically important but perhaps overlooked points: (i) that algorithm speed should be evaluated relative to appropriate solution accuracy; and (ii) that when erroneous measurements possibly exist, the $\ell_1$-fidelity should generally be preferable to the $\ell_2$-fidelity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
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
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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
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
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Cited by
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
Self-citationLinearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
Lin, Z., Liu, R., & Su, Z. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.0367 · Cited by 992
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
“These techniques have been used in a broad range of applications including imaging [20, 41, 61], control [3, 49, 57, 62], estimation [82], signal processing [22, 23, 25, 86], finance [9], distributed optimization [47, 65], and many others.”
MethodAccelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR
Lingala, S. G., Hu, Y., DiBella, E., & Jacob, M. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2100850 · Cited by 664
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-015-0048-x · Cited by 650
Robust sparse coding for face recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995393 · Cited by 589
Self-citationHankel Matrix Rank Minimization with Applications to System Identification and Realization
Fazel, M., Pong, T. K., Sun, D., & Tseng, P. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110853996 · Cited by 487
Minimization of $\ell_{1-2}$ for Compressed Sensing
Yin, P., Lou, Y., He, Q., & Xin, J. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140952363 · Cited by 473
Parallel Multi-Block ADMM with o(1 / k) Convergence
Deng, W., Lai, M.-J., Peng, Z., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-016-0318-2 · Cited by 455
Ghadimi, E., Teixeira, A., Shames, I., & Johansson, M. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2354892 · Cited by 437
A non-adapted sparse approximation of PDEs with stochastic inputs
Doostan, A., & Owhadi, H. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.01.002 · Cited by 436
Fast ℓ1-minimization algorithms and an application in robust face recognition: A review
Yang, A. Y., Sastry, S. S., Ganesh, A., & Ma, Y. (2010) · 2010 IEEE International Conference on Image Processing · doi:10.1109/icip.2010.5651522 · Cited by 414
Robust Low-Rank Tensor Recovery: Models and Algorithms
Goldfarb, D., & Qin, Z. (. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130905010 · Cited by 408
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Li, G., & Pong, T. K. (2015) · SIAM Journal on Optimization · doi:10.1137/140998135 · Cited by 315
Zhao, B., Haldar, J. P., Christodoulou, A. G., & Liang, Z.-P. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2012.2203921 · Cited by 295
A Probabilistic Collaborative Representation Based Approach for Pattern Classification
Cai, S., Zhang, L., Zuo, W., & Feng, X. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.322 · Cited by 295
Regularized Robust Coding for Face Recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235849 · Cited by 259
Self-citationConstructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
Peng, X., Yu, Z., Yi, Z., & Tang, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536752 · Cited by 257
Zhang, C. D., & Xu, Y. L. (2016) · Structural Control and Health Monitoring · doi:10.1002/stc.1785 · Cited by 106
Metadata
- Authors
- Yang, J., & Zhang, Y.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2011-01
- Volume
- 33
- Issue
- 1
- Pages
- 250-278
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2065030431
- Cited by
- 1,201
- References
- 40
- FWCI
- 94.53
- Type
- journal article
- Language
- en
- Open access
- green
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.