The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Minimization of $\ell_{1-2}$ for Compressed Sensing
Abstract
We study minimization of the difference of $\ell_1$ and $\ell_2$ norms as a nonconvex and Lipschitz continuous metric for solving constrained and unconstrained compressed sensing problems. We establish exact (stable) sparse recovery results under a restricted isometry property (RIP) condition for the constrained problem, and a full-rank theorem of the sensing matrix restricted to the support of the sparse solution. We present an iterative method for $\ell_{1-2}$ minimization based on the difference of convex functions algorithm and prove that it converges to a stationary point satisfying the first-order optimality condition. We propose a sparsity oriented simulated annealing procedure with non-Gaussian random perturbation and prove the almost sure convergence of the combined algorithm (DCASA) to a global minimum. Computation examples on success rates of sparse solution recovery show that if the sensing matrix is ill-conditioned (non RIP satisfying), then our method is better than existing nonconvex compressed sensing solvers in the literature. Likewise in the magnetic resonance imaging (MRI) phantom image recovery problem, $\ell_{1-2}$ succeeds with eight projections. Irrespective of the conditioning of the sensing matrix, $\ell_{1-2}$ is better than $\ell_1$ in both the sparse signal and the MRI phantom image recovery problems.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
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
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
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
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
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
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Optimally 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
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
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
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
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
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
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
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
$L_{1/2}$ Regularization: A Thresholding Representation Theory and a Fast Solver
Xu, Z., Chang, X., Xu, F., & Zhang, H. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197412 · Cited by 1,062
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
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
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
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
Restricted isometry properties and nonconvex compressive sensing
Chartrand, R., & Staneva, V. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/3/035020 · Cited by 597
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Dinh, T. P., & Thi, H. A. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623494274313 · Cited by 569
Convex analysis approach to d.c. programming: Theory, Algorithm and Applications
Dinh, T. P., & Thi, H. A. L. (1997) · HAL · Cited by 515
Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
Lai, M.-J., Xu, Y., & Yin, W. (2013) · SIAM Journal on Numerical Analysis · doi:10.1137/110840364 · Cited by 385
Superresolution via Sparsity Constraints
Donoho, D. L. (1992) · SIAM Journal on Mathematical Analysis · doi:10.1137/0523074 · Cited by 298
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Chen, X., Xu, F., & Ye, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090761471 · Cited by 288
Wen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090747695 · Cited by 280
A unified approach to model selection and sparse recovery using regularized least squaresPreprint
Lv, J., & Fan, Y. (2009) · Cited by 263
A unified approach to model selection and sparse recovery using regularized least squares
Lv, J., & Fan, Y. (2009) · The Annals of Statistics · doi:10.1214/09-aos683 · Cited by 252
Error correction via linear programming
Candes, E., Rudelson, M., Tao, T., & Vershynin, R. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.5464411 · Cited by 251
Nonstationary Markov chains and convergence of the annealing algorithm
Gidas, B. (1985) · Journal of Statistical Physics · doi:10.1007/bf01007975 · Cited by 248
Sparse Approximation via Penalty Decomposition Methods
Lu, Z., & Zhang, Y. (2013) · SIAM Journal on Optimization · doi:10.1137/100808071 · Cited by 191
Lou, Y., Yin, P., He, Q., & Xin, J. (2015) · Journal of Scientific Computing · doi:10.1007/s10915-014-9930-1 · Cited by 171
Self-citationEsser, E., Lou, Y., & Xin, J. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/13090540x · Cited by 165
Self-citationZeng, J., Lin, S., Wang, Y., & Xu, Z. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2309076 · Cited by 160
Image processing by simulated annealing
Carnevali, P., Coletti, L., & Patarnello, S. (1985) · IBM Journal of Research and Development · doi:10.1147/rd.296.0569 · Cited by 141
Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
Zhao, Y.-B., & Li, D. (2012) · SIAM Journal on Optimization · doi:10.1137/110847445 · Cited by 120
A coordinate gradient descent method for ℓ 1-regularized convex minimization
Yun, S., & Toh, K.-C. (2009) · Computational Optimization and Applications · doi:10.1007/s10589-009-9251-8 · Cited by 106
Xu, Z., Hai-Liang, G. U. O., Wang, Y., & ZHANG, H. (2012) · Acta Automatica Sinica · doi:10.3724/sp.j.1004.2012.01225 · Cited by 104
Ratio and difference of $l_1$ and $l_2$ norms and sparse representation with coherent dictionaries
Yin, P., Esser, E., & Xin, J. X. (2014) · Communications in Information and Systems · doi:10.4310/cis.2014.v14.n2.a2 · Cited by 101
Self-citationConvergence of the reweighted ℓ 1 minimization algorithm for ℓ 2–ℓ p minimization
Chen, X., & Zhou, W. (2013) · Computational Optimization and Applications · doi:10.1007/s10589-013-9553-8 · Cited by 100
Error Forgetting of Bregman Iteration
Yin, W., & Osher, S. (2012) · Journal of Scientific Computing · doi:10.1007/s10915-012-9616-5 · Cited by 66
Computational developments of ψ -learning
Liu, S., Shen, X., & Wong, W. H. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.1 · Cited by 16
Cited by
DC programming and DCA: thirty years of developments
Le Thi, H. A., & Pham Dinh, T. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1235-y · Cited by 348
Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Lüthen, N., Marelli, S., & Sudret, B. (2021) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/20m1315774 · Cited by 256
Metadata
- Authors
- Yin, P., Lou, Y., He, Q., & Xin, J.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2015-01
- Volume
- 37
- Issue
- 1
- Pages
- A536-A563
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2089106993
- Cited by
- 473
- References
- 56
- FWCI
- 25.29
- 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.