{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T07:38:10Z","timestamp":1784273890312,"version":"3.55.0"},"reference-count":231,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871265"],"award-info":[{"award-number":["61871265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61401501"],"award-info":[{"award-number":["61401501"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571296"],"award-info":[{"award-number":["61571296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2880454","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T23:25:47Z","timestamp":1542065147000},"page":"69883-69906","source":"Crossref","is-referenced-by-count":168,"title":["A Survey on Nonconvex Regularization-Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3083-9611","authenticated-orcid":false,"given":"Fei","family":"Wen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peilin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert C.","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref174","first-page":"3885","article-title":"$\\ell_{q}$\n matrix completion","author":"marjanovic","year":"2012","journal-title":"Proc ICASSP"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.02.025"},{"key":"ref175","author":"lu","year":"2015","journal-title":"Schatten-p quasi-norm regularized matrix optimization via iterative reweighted singular value minimization"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.160"},{"key":"ref177","first-page":"655","article-title":"Low-rank matrix recovery via efficient Schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proc AAAI"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/2337118"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1992.tb01864.x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2016.11.006"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-015-0045-0"},{"key":"ref185","author":"shang","year":"2016","journal-title":"Unified scalable equivalent formulations for Schatten quasi-norms"},{"key":"ref184","first-page":"620","article-title":"Tractable and scalable Schatten quasi-norm approximations for rank minimization","author":"shang","year":"2016","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref183","first-page":"2016","article-title":"Scalable algorithms for tractable schatten quasi-norm minimization","author":"shang","year":"2016","journal-title":"Proc AAAI"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref189","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023709501986"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937541"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/87.3.603"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proc Nat Academy Sci USA"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5621984"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2050625"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.21391"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2016.7552972"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref25","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate \n$O(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0722-4"},{"key":"ref51","author":"bian","year":"2012","journal-title":"Smoothing SQP Algorithm for Non-Lipschitz Optimization With Complexity Analysis"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS752"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1038\/89044"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1016\/j.jeconom.2008.09.017"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asr054"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.725386"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2596379"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2013.782818"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS600"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS559"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0101"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/ass025"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-010-0090-0"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2046900"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/090775397"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0470-2"},{"key":"ref55","author":"chen","year":"2010","journal-title":"Convergence of Reweighted $\\ell _ 1 $ Minimization Algorithms and Unique Solution of Truncated $\\ell _ p $ Minimization"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/090761471"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/120871390"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0613-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.07.001"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref166","first-page":"1496","article-title":"$\\ell_{0}$\n-regularized time-varying sparse inverse covariance estimation for tracking dynamic fMRI brain networks","author":"fu","year":"2015","journal-title":"Proc Annu Int Conf IEEE Eng Med Biol Soc"},{"key":"ref165","first-page":"4767","article-title":"Large-scale \n$\\ell_{q}$\n sparse inverse covariance estimation","author":"marjanovic","year":"2016","journal-title":"Proc IEEE ICASSP"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2416680"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2303429"},{"key":"ref162","first-page":"3849","article-title":"On \n$\\ell_{q}$\n estimation of sparse inverse covariance","author":"marjanovic","year":"2014","journal-title":"Proc IEEE ICASSP"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS720"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOAS215"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF03178905"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035020"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"$L_{1\/2}$\n regularization: A thresholding representation theory and a fast solver","volume":"23","author":"xu","year":"2012","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2009.5193034"},{"key":"ref159","first-page":"2101","article-title":"Sparse inverse covariance selection via alternating linearization methods","author":"scheinberg","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2013.2296133"},{"key":"ref7","first-page":"6068","article-title":"On exact \n$\\ell_{q}$\n denoising","author":"marjanovic","year":"2013","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.tm10560"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2208955"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.682825"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/110840364"},{"key":"ref47","first-page":"3885","article-title":"Stable sparse approximations via nonconvex optimization","author":"saab","year":"2008","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref42","first-page":"1","article-title":"An \n$\\ell_{p}$\n-based reconstruction algorithm for compressed sensing radar imaging","author":"zheng","year":"2016","journal-title":"Proc IEEE Radar Conf"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"6142","DOI":"10.1109\/TIT.2013.2262495","article-title":"The improved bounds of restricted isometry constant for recovery via \n$\\ell_{p}$\n-minimization","volume":"59","author":"wu","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2595499"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2309076"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/140998135"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1137\/120896219"},{"key":"ref77","first-page":"iii-877","article-title":"Iterative hard thresholding and \n$\\ell_{0}$\n regularisation","author":"blumensath","year":"2007","journal-title":"Proc IEEE ICASSP"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"ref75","author":"wang","year":"2014","journal-title":"Convergence of bregman alternating direction method with multipliers for nonconvex composite problems"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/33\/2\/025010"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.10.001"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2017.2744626"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2717585"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2416003"},{"key":"ref63","first-page":"4643","article-title":"Robust sparse recovery for compressive sensing in impulsive noise using \n$\\ell_{p}$\n-norm model fitting","author":"wen","year":"2016","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2598316"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/140985639"},{"key":"ref66","first-page":"675","article-title":"Phase transition and noise sensitivity of \n$\\ell_{p}$\n-minimization for \n$0\\leq p\\leq1$","author":"wengm","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0614-7"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0449"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-013-0555-4"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.038"},{"key":"ref199","first-page":"1","article-title":"Two-pass \n$\\ell_{p}$\n-regularized least-squares algorithm for compressive sensing","author":"pant","year":"2017","journal-title":"Proc IEEE Int Symp Circuits Syst (ISCAS)"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487604"},{"key":"ref194","first-page":"3312","article-title":"Sparse and low rank decomposition using \n$\\ell_{0}$\n penalty","author":"ulfarsson","year":"2015","journal-title":"Proc IEEE ICASSP"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.15"},{"key":"ref196","article-title":"Convergence of multi-block Bregman ADMM for nonconvex composite problems","author":"wang","year":"2015","journal-title":"ArXiv Preprint"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2302740"},{"key":"ref94","first-page":"3613","article-title":"On vector \n$L_{0}$\n penalized multivariate regression","author":"seneviratne","year":"2012","journal-title":"Proc IEEE ICASSP"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS388"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.tm09738"},{"key":"ref192","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000802"},{"key":"ref90","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1214\/009053605000000200","article-title":"Variable selection using MM algorithms","volume":"33","author":"hunter","year":"2005","journal-title":"Ann Statist"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1137\/090753504"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1152\/physiol.00032.2007"},{"key":"ref96","first-page":"3551","article-title":"MIST: \n$\\ell_{0}$\n Sparse linear regression with momentum","author":"marjanovic","year":"2015","journal-title":"Proc IEEE ICASSP"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.03.005"},{"key":"ref82","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-0-387-84858-7_14","author":"hastie","year":"2009","journal-title":"The Elements of Statistical Learning"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.10.010"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015362185"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000256"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/32\/11\/115004"},{"key":"ref89","first-page":"1603","article-title":"Adaptive Lasso for sparse high-dimensional regression models","volume":"18","author":"huang","year":"2008","journal-title":"Stat Sinica"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1198\/016214504000001060"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000796"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158486"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000735"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2017.02.012"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2013.08.006"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179701"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2535227"},{"key":"ref203","author":"chi","year":"2018","journal-title":"Nonconvex optimization meets low-rank matrix factorization An overview"},{"key":"ref204","doi-asserted-by":"publisher","DOI":"10.1561\/2200000058"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"key":"ref207","author":"bertsimas","year":"2017","journal-title":"The trimmed lasso Sparsity and robustness"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2711501"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1380"},{"key":"ref206","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1114-y"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854997"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2647948"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2016.12.014"},{"key":"ref213","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2487966"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2018.2806890"},{"key":"ref215","first-page":"1","article-title":"Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity","volume":"18","author":"yao","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref216","author":"wen","year":"2018","journal-title":"Efficient outlier removal for large scale global structure-from-motion"},{"key":"ref217","first-page":"1193","article-title":"Robust linear estimation using M-estimation and weighted \n$\\ell_{1}$\n regularization: Model selection and recursive implementation","author":"zhang","year":"2009","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref218","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2012.2231074"},{"key":"ref219","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2017.2693967"},{"key":"ref220","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14442-9_58"},{"key":"ref222","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2867995"},{"key":"ref221","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2401574"},{"key":"ref229","author":"le","year":"2017","journal-title":"Deterministic approximate methods for maximum consensus robust fitting"},{"key":"ref228","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref227","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939537"},{"key":"ref226","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2360889"},{"key":"ref225","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.10.008"},{"key":"ref224","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2184537"},{"key":"ref223","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/LSP.2009.2024736","article-title":"$\\ell_{0}$\n norm constraint LMS algorithm for sparse system identification","volume":"16","author":"gu","year":"2009","journal-title":"IEEE Signal Process Lett"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032148"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1080\/757584614"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1080\/757584395"},{"key":"ref129","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019aspremont","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"ref133","first-page":"1","article-title":"Spectral bounds for sparse PCA: Exact and greedy algorithms","author":"moghaddam","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref134","author":"richt\u00e1rik","year":"2012","journal-title":"Alternating maximization Unifying framework for 8 sparse PCA formulations and efficient parallel codes"},{"key":"ref131","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journ\u00e9e","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273601"},{"key":"ref230","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2551327"},{"key":"ref231","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2015.7418196"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-013-4970-y"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-011-9186-3"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.05.068"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2112653"},{"key":"ref140","first-page":"3597","article-title":"Sparse loading noisy PCA using an \n$\\ell_{0}$\n penalty","author":"ulfarsson","year":"2012","journal-title":"Proc ICASSP"},{"key":"ref141","first-page":"4229","article-title":"Vector \n$\\ell_{0}$\n latent-space principal component analysis","author":"luessi","year":"2014","journal-title":"Proc ICASSP"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1111\/ectj.12061"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1093\/nsr\/nwt032"},{"key":"ref144","author":"qiu","year":"2015","journal-title":"Smart grid using big data analytics a random matrix theory approach"},{"key":"ref2","author":"hastie","year":"2016","journal-title":"Statistical Learning with Sparsity The Lasso and Generalizations"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1009210544"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1214\/07-AOS582","article-title":"Lasso-type recovery of sparse representations for high-dimensional data","volume":"37","author":"meinshausen","year":"2009","journal-title":"Ann Statist"},{"key":"ref109","doi-asserted-by":"crossref","first-page":"661","DOI":"10.3934\/ipi.2007.1.661","article-title":"Signal recovery from incomplete measurements in the presence of outliers","volume":"1","author":"popilka","year":"2007","journal-title":"Inverse Problems Imag"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924688"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.02.002"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2011.2168211"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344972"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/83.935034"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2049927"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2296605"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842580"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.891805"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.852196"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/32\/7\/075004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref13","first-page":"855","article-title":"Waveshrink with firm shrinkage","volume":"7","author":"gao","year":"1997","journal-title":"Statistica Sinica"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/11\/115011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1137\/12087178X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2014277"},{"key":"ref119","first-page":"5369","article-title":"$\\ell_{0}$\n TV: A new method for image restoration in the presence of impulse noise","author":"yuan","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037526"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/83.892455"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.891067"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.02.002"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2705646"},{"key":"ref121","first-page":"4892","article-title":"Parameter estimation for LPregularized image deconvolution","author":"zhou","year":"2015","journal-title":"Proc IEEE Int Conf Image Process (ICIP)"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2596704"},{"key":"ref123","first-page":"1783","article-title":"Fast iteratively reweighted least squares for \n$\\text{L}_{P}$\n regularized image deconvolution and reconstruction","author":"zhou","year":"2014","journal-title":"Proc IEEE Int Conf Image Process (ICIP)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08531588.pdf?arnumber=8531588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T04:38:41Z","timestamp":1643258321000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8531588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":231,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2880454","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}