Fetching the paper…
Reading the bibliography…
In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning.
Y. Nesterov, “A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) O(1/k^{2}) ,” Soviet Math. Doklady
1983
Earlier work this paper cites.
D. L. Donoho, I. M. Johnstone, J. C. Hoch, and A. S. Stern, “Maximum entropy and the nearly black object,” J. Roy. Statist. Soc. B (Methodological)
1992
Earlier work this paper cites.
D. L. Donoho, I. M. Johnstone, “Ideal spatial adaptation by wavelet shrinkage,” biometrika
1994
Earlier work this paper cites.
I. T. Jollife, “Rotation of principal components: choice of normalization constraints,” J. Appl. Stat
1995
Earlier work this paper cites.
J. Cadima and I. T. Jollife, “Loadings and correlations in the interpretation of principal components,” J. Appl. Stat
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Roy. Statist. Soc. B (Methodological)
1996
Earlier work this paper cites.
A. Antoniadis, “Wavelets in Statistics: A Review” (with discussion), Journal of the Italian Statistical Association
1997
Earlier work this paper cites.
H.-Y. Gao and A. G. Bruce, “Wave shrink with firm shrinkage,” Statistica Sinica
1997
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comput
1998
Earlier work this paper cites.
M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, “Image inpainting,” in Proc. 27th Annu. Conf. Comp. Graph. Int. Technol
2000
Earlier work this paper cites.
C. Croux and G. Haesbroeck, “Principal component analysis based on robust estimators of the covariance or correlation matrix: influence functions and efficiencies,” Biometrika
2000
Earlier work this paper cites.
J. Fan and R. Li, “Variable selection via nonconcave penalized likelihood and its oracle properties,” Journal of the American Statistical Association
2001
Earlier work this paper cites.
M. Elad and Y. Hel-Or, “Fast super-resolution reconstruction algorithm for pure translational motion and common space-invariant blur,” IEEE Trans. Image Process
2001
Earlier work this paper cites.
P. Windyga, “Fast impulsive noise removal,” IEEE Trans. Image Process
2001
Earlier work this paper cites.
I. Johnstone, “On the distribution of the largest eigenvalue in principal components analysis,” The Annals of Statistics
2001
Earlier work this paper cites.
J. Khan, J. Wei, M. Ringner, et al., “Classification and Diagnostic Prediction of Cancers Using Gene Expression Profiling and Artificial Neural Networks,” Nature Medicine
2001
Earlier work this paper cites.
F. De la Torre and M. J. Black, “Robust principal component analysis for computer vision,” ICCV
2001
Earlier work this paper cites.
J. Fan and R. Li, “Variable selection for Cox’s proportional hazards model and frailty model,” Annals of Statistics
2002
Earlier work this paper cites.
I. T. Jolliffe, N. T. Trendafilov, and M. Uddin, “A modified principal component technique based on the LASSO,” Journal Computational Graphical Statistics
2003
Earlier work this paper cites.
F. De La Torre and M. J. Black, “A framework for robust subspace learning,” International Journal of Computer Vision
2003
Earlier work this paper cites.
J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Trans. Inf. Theory
2004
Earlier work this paper cites.
J. Fan and H. Peng, “On non-concave penalized likelihood with diverging number of parameters,” Annals of Statistics
2004
Earlier work this paper cites.
J. Fan and R. Li, “New estimation and model selection procedures for semiparametric modeling in longitudinal data analysis,” Journal American Statistical Association
2004
Earlier work this paper cites.
P. Chen and D. Suter, “Recovering the missing components in a large noisy low-rank matrix: Application to SFM,” IEEE Trans. Pattern Anal. Mach. Intell
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe. Convex optimization
2004
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Trans. Inf. Theory
2005
Earlier work this paper cites.
D. Hunter and R. Li, “Variable selection using mm algorithms,” Annals of Statistics
2005
Earlier work this paper cites.
M. Elad, J. L. Starck, P. Querre, and D. L. Donoho, “Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA),” Appl. Comput. Harmon. Anal
2005
Earlier work this paper cites.
R. Chan, C.-W. Ho, and M. Nikolova, “Salt-and-pepper noise removal by median-type noise detectors and de tail-preserving regularization,” IEEE Trans. Image Process
2005
Earlier work this paper cites.
T. Hashimoto, “Bounds on a probability for the heavy tailed distribution and the probability of deficient decoding in sequential decoding,” IEEE Trans. Inf. Theory
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory
2006
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory
2006
Earlier work this paper cites.
J. Fan, H. Lin, and Y. Zhou, “Local partial likelihood estimation for life time data,” Annals of Statistics
2006
Earlier work this paper cites.
H. Zou, “The adaptive lasso and its oracle properties,” Journal American Statistical Association
2006
Earlier work this paper cites.
H. Zou, T. Hastie, and R. Tibshirani, “Sparse principal component analysis,” J. Comput. Graph. Stat
2006
Earlier work this paper cites.
B. Moghaddam, Y. Weiss, and S. Avidan, “Spectral bounds for sparse PCA: Exact and greedy algorithms,” Advances in Neural Information Processing Systems
2006
Earlier work this paper cites.
M. Aharon, M. Elad, and A. Bruckstein, “K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Trans. Signal Process
2006
Earlier work this paper cites.
R. G. Baraniuk, “Compressive sensing,” IEEE Signal Process. Magazine
2007
Earlier work this paper cites.
M. Lustig, D. Donoho, and J. M. Pauly, “Sparse MRI: The application of compressed sensing for rapid MR imaging,” Magnetic Resonance Medicine
2007
Earlier work this paper cites.
R. Chartrand, “Exact reconstruction of sparse signals via nonconvex minimization,” IEEE Signal Process. Lett
2007
Earlier work this paper cites.
T. Blumensath, M. Yaghoobi, and M. E. Davies, “Iterative hard thresholding and l0 regularisation,” IEEE ICASSP
2007
Earlier work this paper cites.
W. Göbel and F. Helmchen, “In vivo calcium imaging of neural network function,” Physiology
2007
Earlier work this paper cites.
B. Popilka, S. Setzer, and G. Steidl, “Signal recovery from incomplete measurements in the presence of outliers,” Inverse Problems Imag
2007
Earlier work this paper cites.
L. Bar, A. Brook, N. Sochen, and N. Kiryati, “Deblurring of color images corrupted by impulsive noise,” IEEE Trans. Image Process
2007
Earlier work this paper cites.
P. Civicioglu, “Using uncorrupted neighborhoods of the pixels for impulsive noise suppression with ANFIS,” IEEE Trans. Image Process
2007
Earlier work this paper cites.
A. d’Aspremont, L. El Ghaoui, M. I. Jordan, et al., “A direct formulation for sparse PCA using semidefinite programming,” SIAM Rev
2007
Earlier work this paper cites.
B. K. Sriperumbudur, D. A. Torres, G. R. Lanckriet, “Sparse eigen methods by D.C. programming,” in Proc. 24th Int. Conf. Machine Learning
2007
Earlier work this paper cites.
R. Chartrand and V. Staneva, “Restricted isometry properties and nonconvex compressive sensing,” Inverse Problems
2008
Earlier work this paper cites.
E. J. Candès and M. Wakin, “An introduction to compressive sampling,” IEEE Signal Process. Mag
2008
Earlier work this paper cites.
E. J. Candès, “The restricted isometry property and its implications for compressed sensing,” Comptes. Rendus. Mathematique
2008
Earlier work this paper cites.
R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, “A simple proof of the restricted isometry property for random matrices,” Construct. Approx
2008
Earlier work this paper cites.
E. J. Candès, M. B. Wakin, and S. P. Boyd, “Enhancing sparsity by reweighted ℓ 1 \ell_{1} minimization,” J. Fourier Anal. Appl
2008
Earlier work this paper cites.
R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in Proc. IEEE Int. Conf. Acoust, Speech, Signal Process
2008
Earlier work this paper cites.
R. Saab, R. Chartrand, and O. Yilmaz, “Stable sparse approximations via nonconvex optimization,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process
2008
Earlier work this paper cites.
J. Huang, S. Ma, and C. H. Zhang, “Adaptive Lasso for sparse high-dimensional regression models,” Statistica Sinica
2008
Earlier work this paper cites.
H. Zou and R. Li, “One-step sparse estimates in nonconcave penalized likelihood models,” Annals of Statistics
2008
Earlier work this paper cites.
E. J. Candès and P. A. Randall, “Highly robust error correction by convex programming,” IEEE Trans. Inf. Theory
2008
Earlier work this paper cites.
A. d’Aspremont, F. R. Bach, and L. E. Ghaoui, “Optimal solutions for sparse principal component analysis,” J. Mach. Learn. Res
2008
Earlier work this paper cites.
H. P. Shen and J. Z. Huang, “Sparse principal component analysis via regularized low rank matrix approximation,” J. Multivariate Anal
2008
Earlier work this paper cites.
P. Bickel and E. Levina, “Covariance Regularization by Thresholding,” The Annals of Statistics
2008
Earlier work this paper cites.
N. E. Karoui, “Operator Norm Consistent Estimation of Large Dimensional Sparse Covariance Matrices,” The Annals of Statistics
2008
Earlier work this paper cites.
J. Fan, Y. Fan, and J. Lv, “High dimensional covariance matrix estimation using a factor model,” Journal of Econometrics
2008
Earlier work this paper cites.
H. Zou and R. Li, “One-step sparse estimates in nonconcave penalized likelihood models (with discussion),” The Annals of Statistics
2008
Earlier work this paper cites.
N. Meinshausen and B. Yu, “Lasso-type recovery of sparse representations for high-dimensional data,” Annals of Statistics
2009
Earlier work this paper cites.
R. Chartrand, “Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data,” in Proc. IEEE Int. Symp. Biomed. Imag
2009
Earlier work this paper cites.
M. A. Herman and T. Strohmer, “High-resolution radar via compressed sensing,” IEEE Trans. Signal Process
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imag. Sci
2009
Earlier work this paper cites.
S. Becker, J. Bobin, and E. Candes, NESTA: A fast and accurate first-order method for sparse recovery
2009
Earlier work this paper cites.
D. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” PNAS
2009
Earlier work this paper cites.
A. Cohen, W. Dahmen, R. DeVore, “Compressed sensing and best k-term approximation,” J. Am. Math. Soc
2009
Earlier work this paper cites.
S. Foucart and M.-J. Lai, “Sparsest solutions of underdetermined linear systems via ℓ q \ell_{q} -minimization for 0 < q ≤ 1 0<q\leq 1 ,” Appl. Comput. Harmon. Anal
2009
Earlier work this paper cites.
H. Mohimani, M. Babie-Zadeh, and C. Jutten, “A fast approach for overcomplete sparse decomposition based on smoothed ℓ 0 \ell_{0} -norm,” IEEE Trans. Signal Process
2009
Earlier work this paper cites.
T. Hastie, R. Tibshirani, and J. Friedman, Unsupervised learning: The elements of statistical learning
2009
Earlier work this paper cites.
J.-F. Cai, S. Osher, and Z. Shen, “Split Bregman methods and frame based image restoration,” Multiscale Model. Simul
2009
Earlier work this paper cites.
A. Rothman, E. Levina, and J. Zhu, “Generalized Thresholding of Large Covariance Matrices,” Journal of the American Statistical Association
2009
Earlier work this paper cites.
J. Fan, Y. Feng, and Y. Wu, “Network exploration via the adaptive LASSO and SCAD penalties,” Annals of Applied Statistics
2009
Earlier work this paper cites.
C. Lam and J. Fan, “Sparsistency and rates of convergence in large covariance matrix estimation,” The Annals of Statistics
2009
Earlier work this paper cites.
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” IEEE Comput
2009
Earlier work this paper cites.
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM J. Matrix Anal. Appl
2009
Cited alongside, same era.
Z. G. Zhang, S. C. Chan, Y. Zhou, and Y. Hu, “Robust linear estimation using M-estimation and weighted L1 regularization: Model selection and recursive implementation,” in IEEE Int. Symp. Circuits and Systems
2009
Cited alongside, same era.
Y. Gu, J. Jin,and S. Mei, “ ℓ 0 \ell_{0} norm constraint LMS algorithm for sparse system identification,” IEEE Signal Processing Letters
2009
Cited alongside, same era.
C. Zhang, “Nearly unbiased variable selection under minimax concave penalty,” The Annals of Statistics
2010
Cited alongside, same era.
L. C. Potter, E. Ertin, J. T. Parker, and M. Cetin, “Sparsity and compressed sensing in radar imaging,” IEEE Proceedings
2010
J. Fan, F. Han, and H. Liu, “Challenges of big data analysis,” National science review
2014
Later among the works it cites.
H. Liu, L. Wang, and T. Zhao, “Sparse covariance matrix estimation with eigenvalue constraints,” Journal of Computational and Graphical Statistics
2014
Later among the works it cites.
G. Marjanovic and A. O. Hero III, “On lq estimation of sparse inverse covariance,” IEEE ICASSP
2014
Later among the works it cites.
G. Marjanovic and V. Solo, “On lq optimization and sparse inverse covariance selection,” IEEE Trans. Signal Proces
2014
Later among the works it cites.
P. Netrapalli, U. N. Niranjan, S. Sanghavi, et al., “Non-convex robust pca,” in Advances in Neural Information Processing Systems
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
C. R. Berger, Z. Wang, J. Huang, and S. Zhou, “Application of compressive sensing to sparse channel estimation,” IEEE Commun. Mag
2010
Cited alongside, same era.
J. Yang, J. Wright, T. S. Huang, and Y. Ma, “Image super-resolution via sparse representation,” IEEE Trans. Image Process
2010
Cited alongside, same era.
I. Daubechies, R. DeVore, M. Fornasier, et al. “Iteratively reweighted least squares minimization for sparse recovery,” Communications on Pure and Applied Mathematics
2010
Cited alongside, same era.
X. Chen, F. Xu, and Y. Ye, “Lower bound theory of nonzero entries in solutions of l2-lp minimization,” SIAM J. Sci. Comput
2010
Cited alongside, same era.
X. Chen and W. Zhou, “Convergence of reweighted l1 minimization algorithms and unique solution of truncated lp minimization,” Preprint
2010
Cited alongside, same era.
N. Mourad and J. P. Reilly, “Minimizing nonconvex functions for sparse vector reconstruction,” IEEE Trans. Signal Process
2010
Cited alongside, same era.
Z. Xu, H. Zhang, Y. Wang, et al., “L1/2 regularization,” Science China Information Sciences
2010
Cited alongside, same era.
F. Seidel, C. Hage, and M. Kleinsteuber, “pROST: a smoothed ℓ p \ell_{p} -norm robust online subspace tracking method for background subtraction in video,” Machine Vision and Applications
2014
Later among the works it cites.
D. Malioutov and A. Aravkin, “Iterative log thresholding,” in IEEE Int. Conf. Acoustics, Speech and Signal Processing (ICASSP)
2014
Later among the works it cites.
L. Chen and Y. Gu, “On the null space constant for Lp minimization,” IEEE Signal Processing Letters
2015
Later among the works it cites.
W. Bian and X. Chen, “Linearly constrained non-Lipschitz optimization for image restoration,” SIAM Journal on Imaging Sciences
2015
Later among the works it cites.
K. Bredies, D. Lorenz, and S. Reiterer, “Minimization of non-smooth, non-convex functionals by iterative thresholding,” J. Optim. Theory Appl
2015
Later among the works it cites.
G. Li and T. K. Pong, “Global convergence of splitting methods for nonconvex composite optimization,” SIAM J. Optimization
2015
Later among the works it cites.
Y. Jiao, B. Jin, X. Lu, “A primal dual active set with continuation algorithm for the ℓ 0 \ell_{0} -regularized optimization problem,” Applied and Computational Harmonic Analysis
2015
Later among the works it cites.
G. Marjanovic, M. O. Ulfarsson, and A. O. Hero III, “MIST: l0 Sparse linear regression with momentum,” IEEE ICASSP
2015
Later among the works it cites.
K. Hohm, M. Storath, and A. Weinmann, “An algorithmic framework for Mumford-Shah regularization of inverse problems in imaging,” Inverse Probl
2015
Later among the works it cites.
G. Yuan and B. Ghanem, “L0 TV: A new method for image restoration in the presence of impulse noise,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit
2015
Later among the works it cites.
X. Zhou, F. Zhou, X. Bai, “Parameter estimation for Lp regularized image deconvolution,” IEEE Int. Conf. Image Process. (ICIP)
2015
Later among the works it cites.
D. Hajinezhad and M. Hong, “Nonconvex alternating direction method of multipliers for distributed sparse principal component analysis,” GlobalSIP
2015
Later among the works it cites.
R. C. Qiu and P. Antonik, Smart Grid and Big Data: Theory and Practice
2015
Later among the works it cites.
G. Marjanovic and A. O. Hero III, “L0 Sparse Inverse Covariance Estimation,” IEEE Trans. Signal Proces
2015
Later among the works it cites.
Z. Fu, S. Han, A. Tan, et al., “L0-regularized time-varying sparse inverse covariance estimation for tracking dynamic fMRI brain networks,” 37th Annual Int. Conf. IEEE Engin. Medicine and Biology Society
2015
Later among the works it cites.
2015
Later among the works it cites.
M. Malek-Mohammadi, M. Babaie-Zadeh, and M. Skoglund, “Performance guarantees for Schatten-p quasi-norm minimization in recovery of low-rank matrices,” Signal Processing
2015
Later among the works it cites.
M. O. Ulfarsson, V. Solo, and G. Marjanovic, “Sparse and low rank decomposition using l0 penalty,” IEEE ICASSP
2015
Later among the works it cites.
Z. Kang, C. Peng, and Q. Cheng, “Robust pca via nonconvex rank approximation,” IEEE Int. Conf. Data Mining (ICDM)
2015
Later among the works it cites.
2015
Later among the works it cites.
S. Wu, X. Zhang, N. Guan, D. Tao, X. Huang, and Z. Luo, “Non-negative low-rank and group-sparse matrix factorization,” in Int. Conf. Multimedia Modeling
2015
Later among the works it cites.
S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar, and B. Hassibi, “Simultaneously structured models with application to sparse and low-rank matrices,” IEEE Transactions Information Theory
2015
Later among the works it cites.
L. Weruaga, and S. Jimaa, “Exact NLMS algorithm with ℓ p {\ell_{p}} -norm constraint,” IEEE Signal Processing Letters
2015
Later among the works it cites.
T. Hastie, R. Tibshirani,M. Wainwright. Statistical learning with sparsity: the lasso and generalizations
2016
Later among the works it cites.
J. Woodworth, R. Chartrand, “Compressed sensing recovery via nonconvex shrinkage penalties,” Inverse Problems
2016
Later among the works it cites.
X. Jiang, R. Ying, F. Wen, et al., “An improved sparse reconstruction algorithm for speech compressive sensing using structured priors,” in Proc. IEEE Int. Conf. on Multimedia and Expo (ICME 2016)
2016
Later among the works it cites.
L. Zheng, A. Maleki, Q. Liu, et al., “An ℓ p \ell_{p} -based reconstruction algorithm for compressed sensing radar imaging,” IEEE Radar Conference
2016
Later among the works it cites.
F. Wen, P. Liu. Y. Liu, R. C. Qiu, and W. Yu, “Robust sparse recovery for compressive sensing in impulsive noise using Lp-norm model fitting,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process
2016
Later among the works it cites.
H. Weng, L. Zheng, A. Maleki, et al., “Phase transition and noise sensitivity of ℓ p \ell_{p} -minimization for 0 ≤ p ≤ 1 0\leq p\leq 1 ,” in Proc. IEEE International Symposium Information Theory (ISIT)
2016
Later among the works it cites.
J. Zeng, S. Lin, and Z. Xu, “Sparse regularization: Convergence of iterative jumping thresholding algorithm,” IEEE Trans. Signal Process
2016
Later among the works it cites.
M. Hong, Z. Q. Luo, and M. Razaviyayn, “Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,” SIAM J. Optimization
2016
Later among the works it cites.
C. Bao, B. Dong, L. Hou, et al., “Image restoration by minimizing zero norm of wavelet frame coefficients,” Inverse Problems
2016
Later among the works it cites.
M. Nikolova, “Relationship between the optimal solutions of least squares regularized with ℓ 0 \ell_{0} -norm and constrained by k-sparsity,” Applied and Computational Harmonic Analysis
2016
Later among the works it cites.
C. Mia and H. Yu, “Alternating iteration for Lp regularized CT reconstruction,” IEEE Access
2016
Later among the works it cites.
H. Chang, L. Luo, J. Yang, et al., “Schatten p-norm based principal component analysis,” Neurocomputing
2016
Later among the works it cites.
J. Fan, Y. Liao, and H. Liu, “An overview on the estimation of large covariance and precision matrices,” The Econometrics Journal
2016
Later among the works it cites.
F. Wen, Y. Yang, P. Liu, and R. C. Qiu, “Positive definite estimation of large covariance matrix using generalized nonconvex penalties,” IEEE Access
2016
Later among the works it cites.
G. Marjanovic, M. Ulfarsson, and V. Solo, “Large-scale l0 sparse inverse covariance estimation,” IEEE ICASSP
2016
Later among the works it cites.
Z. F. Jin, Z. Wan, Y. Jiao, et al., “An alternating direction method with continuation for nonconvex low rank minimization,” Journal of Scientific Computing
2016
Later among the works it cites.
R. Sun and Z. Q. Luo, “Guaranteed matrix completion via non-convex factorization,” IEEE Trans. Inf. Theory
2016
Later among the works it cites.
F. Shang, Y. Liu, and J. Cheng, “Tractable and scalable Schatten quasi-norm approximations for rank minimization,” in Proc. 19th Int. Conf. Artif. Intell. Statist
2016
Later among the works it cites.
2016
Later among the works it cites.
Q. Wang, F. Chen, Q. Gao, et al., “On the Schatten norm for matrix based subspace learning and classification,” Neurocomputing
2016
Later among the works it cites.
H. Liu, T. Yao and R. Li, “Global solutions to folded concave penalized nonconvex learning,” Annals of statistics
2016
Later among the works it cites.
A. Parekh and I. Selesnick, “Enhanced low-rank matrix approximation,” IEEE Signal Processing Letters
2016
Later among the works it cites.
C. Bao, H. Ji, Y. Quan, and Z. Shen, “Dictionary learning for sparse coding: Algorithms and convergence analysis,” IEEE Transactions Pattern Analysis and Machine Intelligence
2016
Later among the works it cites.
P. V. Giampouras, K. E. Themelis, A. A. Rontogiannis, and K. D. Koutroumbas, “Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing,” IEEE Transactions Geoscience and Remote Sensing
2016
Later among the works it cites.
R. Ge, J. D. Lee, and T. Ma, “Matrix completion has no spurious local minimum,” in Advances in Neural Information Processing Systems
2016
Later among the works it cites.
F. Wen, L. Pei, Y. Yang, W. Yu, and P. Liu, “Efficient and robust recovery of sparse signal and image using generalized nonconvex regularization,” IEEE Transactions on Computational Imaging
2017
Later among the works it cites.
L. Zheng, A. Maleki, H. Weng, et al., “Does Lp-minimization outperform L1-minimization,” IEEE Transactions Information Theory
2017
Later among the works it cites.
F. Wen, P. Liu. Y. Liu, R. C. Qiu, and W. Yu, “Robust sparse recovery in impulsive noise via Lp-L1 optimization,” IEEE Trans. Signal Process
2017
Later among the works it cites.
N. Zhang, Q. Li, “On optimal solutions of the constrained ℓ 0 \ell_{0} regularization and its penalty problem,” Inverse Problems
2017
Later among the works it cites.
F. Wen, L. Adhikari, L. Pei, et al., “Nonconvex regularization based sparse recovery and demixing with application to color image inpainting,” IEEE Access
2017
Later among the works it cites.
Z. X. Cui and Q. Fan, “A nonconvex nonsmooth regularization method for compressed sensing and low rank matrix completion,” Digital Signal Processing
2017
Later among the works it cites.
J. K. Pant and S. Krishnan, “Two-pass ℓ p \ell_{p} -regularized least-squares algorithm for compressive sensing,” IEEE Int. Symp. Circuits and Systems (ISCAS)
2017
Later among the works it cites.
Y. Gao, J. Peng, and S. Yue, “Stability and robustness of the l2/lq-minimization for block sparse recovery,” Signal Processing
2017
Later among the works it cites.
P. Jain and P. Kar, “Non-convex optimization for machine learning,” Foundations and Trends in Machine Learning
2017
Later among the works it cites.
H. Liu, T. Yao, R. Li, and Y. Ye, “Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions,” Mathematical programming
2017
Later among the works it cites.
2017
Later among the works it cites.
I. Selesnick, “Sparse regularization via convex analysis,” IEEE Transactions Signal Processing
2017
Later among the works it cites.
I. Selesnick, “Total variation denoising via the Moreau envelope,” IEEE Signal Processing Letters
2017
Later among the works it cites.
Z. Li, S. Ding, T. Hayashi and Y. Li, “Incoherent dictionary learning with log-regularizer based on proximal operators,” Digital Signal Processing
2017
Later among the works it cites.
C. G. Tsinos, A. A. Rontogiannis, and K. Berberidis, “Distributed blind hyperspectral unmixing via joint sparsity and low-rank constrained non-negative natrix factorization,” IEEE Transactions Computational Imaging
2017
Later among the works it cites.
2017
Later among the works it cites.
Y. Chen and Y. Chi, “Harnessing structures in big data via guaranteed low-rank matrix estimation,” IEEE Signal Processing Magazine
2018
Closest in time.
2018
Closest in time.
Z. Li, S. Ding, W. Chen, Z. Yang, and S. Xie, “Proximal alternating minimization for analysis dictionary learning and convergence analysis,” IEEE Transactions Emerging Topics in Computational Intelligence
2018
Closest in time.
Q. Yao, and J. T. Kwok, “Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity,” The Journal of Machine Learning Research
2018
Closest in time.
2018
Closest in time.
W. Chen, “Simultaneously sparse and low-Rank matrix reconstruction via nonconvex and nonseparable regularization,” IEEE Transactions Signal Processing
2018
Closest in time.
F. Shang, Y. Liu, and J. Cheng, “Scalable algorithms for tractable Schatten quasi-norm minimization,” in AAAI
2022
Closest in time.
J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma, “Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization,” in Advances in Neural Information Processing Systems
2088
Closest in time.