A non-convex piecewise quadratic approximation of $\ell _{0}$ regularization: theory and accelerated algorithm
- 2 December 2022
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 86 (2) , 323-353
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11901382, 12101247, 11771275, 11971302)
This publication has 40 references indexed in Scilit:
- Nearly unbiased variable selection under minimax concave penaltyThe Annals of Statistics, 2010
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- Iteratively reweighted least squares minimization for sparse recoveryCommunications on Pure and Applied Mathematics, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Compressed sensing and best 𝑘-term approximationJournal of the American Mathematical Society, 2008
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- De-noising by soft-thresholdingIEEE Transactions on Information Theory, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Image compression through wavelet transform codingIEEE Transactions on Information Theory, 1992