The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Sparse Regularization via Convex Analysis
Open accessAbstract
Sparse approximate solutions to linear equations are classically obtained via L1 norm regularized least squares, but this method often underestimates the true solution. As an alternative to the L1 norm, this paper proposes a class of nonconvex penalty functions that maintain the convexity of the least squares cost function to be minimized, and avoids the systematic underestimation characteristic of L1 norm regularization. The proposed penalty function is a multivariate generalization of the minimax-concave penalty. It is defined in terms of a new multivariate generalization of the Huber function, which in turn is defined via infimal convolution. The proposed sparse-regularized least squares cost function can be minimized by proximal algorithms comprising simple computations.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
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
Robust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
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
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
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
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
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Robust Estimation of a Location Parameter
Huber, P. J. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-4380-9_35 · Cited by 1,455
An EM algorithm for wavelet-based image restoration
Figueiredo, M. A. T., & Nowak, R. D. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.814255 · Cited by 1,219
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
Mohimani, H., Babaie-Zadeh, M., & Jutten, C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007606 · Cited by 1,091
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
One-step sparse estimates in nonconcave penalized likelihood modelsPreprint
Zou, H., & Li, R. (2008) · Cited by 919
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Shift of whispering-gallery modes in microspheres by protein adsorption
Arnold, S., Khoshsima, M., Teraoka, I., Holler, S., & Vollmer, F. (2003) · Optics Letters · doi:10.1364/ol.28.000272 · Cited by 736
One-step sparse estimates in nonconcave penalized likelihood models
Zou, H., & Li, R. (2008) · The Annals of Statistics · doi:10.1214/009053607000000802 · Cited by 683
1 The Cosparse Analysis Model and Algorithms✩Preprint
Nama, S., Davies, M. E., Elad, M., & Gribonval, R. (2016) · Cited by 426
The cosparse analysis model and algorithms
Nam, S., Davies, M. E., Elad, M., & Gribonval, R. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.03.006 · Cited by 353
Latent Variable Bayesian Models for Promoting Sparsity
Wipf, D. P., Rao, B. D., & Nagarajan, S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162174 · Cited by 305
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
WAVESHRINK WITH FIRM SHRINKAGE
Gao, H., & Bruce, A. G. (1997) · Cited by 277
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
Nikolova, M., Ng, M. K., & Tam, C.-P. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2052275 · Cited by 276
Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
Chen, P.-Y., & Selesnick, I. W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2329274 · Cited by 232
Self-citationA Proximal Iteration for Deconvolving Poisson Noisy Images Using Sparse Representations
Dupe, F.-X., Fadili, J. M., & Starck, J.-L. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2008223 · Cited by 203
Compressed Sensing Recovery via Nonconvex Shrinkage PenaltiesPreprint
Woodworth, J., Chartr, R., & Member, S. (2016) · Cited by 190
Sparse Signal Estimation by Maximally Sparse Convex Optimization
Selesnick, I. W., & Bayram, I. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2298839 · Cited by 188
Self-citationIterative thresholding algorithms
Fornasier, M., & Rauhut, H. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.10.005 · Cited by 183
Compressed sensing recovery via nonconvex shrinkage penalties
Woodworth, J., & Chartrand, R. (2016) · Inverse Problems · doi:10.1088/0266-5611/32/7/075004 · Cited by 176
Sparsity-based algorithm for detecting faults in rotating machines
He, W., Ding, Y., Zi, Y., & Selesnick, I. W. (2016) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2015.11.027 · Cited by 163
Self-citationA Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
Soubies, E., Blanc‐Féraud, L., & Aubert, G. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/151003714 · Cited by 157
Artifact-Free Wavelet Denoising: Non-convex Sparse Regularization, Convex Optimization
Ding, Y., & Selesnick, I. (2015) · IEEE Signal Processing Letters · doi:10.1109/lsp.2015.2406314 · Cited by 152
Self-citationSparsity and persistence: mixed norms provide simple signal models with dependent coefficients
Kowalski, M., & Torrésani, B. (2008) · Signal Image and Video Processing · doi:10.1007/s11760-008-0076-1 · Cited by 134
A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
Chouzenoux, É., Jezierska, A., Pesquet, J.-C., & Talbot, H. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/11085997x · Cited by 129
Markovian reconstruction using a GNC approach
Nikolova, M. (1999) · IEEE Transactions on Image Processing · doi:10.1109/83.784433 · Cited by 111
Enhanced Low-Rank Matrix Approximation
Parekh, A., & Selesnick, I. (2016) · IEEE Signal Processing Letters · doi:10.1109/lsp.2016.2535227 · Cited by 104
Self-citationThe Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
Chen, L., & Gu, Y. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2330349 · Cited by 93
Sparse Signal Approximation via Nonseparable Regularization
Selesnick, I., & Farshchian, M. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2669904 · Cited by 91
Self-citationOn the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
Bayram, İ. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2502551 · Cited by 83
Shrinkage mappings and their induced penalty functions
Chartrand, R. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6853752 · Cited by 83
Perspective Functions: Properties, Constructions, and Examples
Combettes, P. L. (2017) · Set-Valued and Variational Analysis · doi:10.1007/s11228-017-0407-x · Cited by 66
Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization
Lanza, A., Morigi, S., Selesnick, I., & Sgallari, F. (2016) · Numerische Mathematik · doi:10.1007/s00211-016-0842-x · Cited by 66
Self-citationHomotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares
Soussen, C., Idier, J., Duan, J., & Brie, D. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2421476 · Cited by 50
A General Framework for Sparsity-Based Denoising and Inversion
Gholami, A., & Hosseini, S. M. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2164074 · Cited by 49
A new generalized thresholding algorithm for inverse problems with sparsity constraints
Voronin, S., & Chartrand, R. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6637929 · Cited by 44
A Class of Nonconvex Penalties Preserving Overall Convexity in Optimization-Based Mean Filtering
Malek-Mohammadi, M., Rojas, C. R., & Wahlberg, B. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2612179 · Cited by 42
Nikolova, M. (2015) · Springer eBooks · doi:10.1007/978-1-4939-0790-8_5 · Cited by 37
Nikolova, M. (2010) · Springer eBooks · doi:10.1007/978-0-387-92920-0_5 · Cited by 34
On convexification/optimization of functionals including an l2-misfit termPreprint
Carlsson, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.09378 · Cited by 25
An augmented Lagrangian approach to linear inverse problems with compound regularization
Afonso, M. V., Bioucas‐Dias, J. M., & Figueiredo, M. A. T. (2010) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2010.5650379 · Cited by 22
Cited by
Review of noise removal techniques in ECG signals
Chatterjee, S., Thakur, R. S., Yadav, R. N., Gupta, L., & Raghuvanshi, D. K. (2020) · IET Signal Processing · doi:10.1049/iet-spr.2020.0104 · Cited by 333
Metadata
- Authors
- Selesnick, I.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2017-09-01
- Volume
- 65
- Issue
- 17
- Pages
- 4481-4494
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2620850570
- Cited by
- 429
- References
- 56
- FWCI
- 23.08
- 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.