{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:48:42Z","timestamp":1761709722852,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2017YFC0403600"],"award-info":[{"award-number":["2017YFC0403600"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61531166005","N_CityU 104\/15"],"award-info":[{"award-number":["61531166005","N_CityU 104\/15"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.2978615","type":"journal-article","created":{"date-parts":[[2020,3,5]],"date-time":"2020-03-05T23:42:55Z","timestamp":1583451775000},"page":"5244-5259","source":"Crossref","is-referenced-by-count":19,"title":["Learning Proximal Operator Methods for Nonconvex Sparse Recovery with Theoretical Guarantee"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0529-1367","authenticated-orcid":false,"given":"Chengzhu","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8427-1021","authenticated-orcid":false,"given":"Yuantao","family":"Gu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1710-3818","authenticated-orcid":false,"given":"Badong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hongbing","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Hing Cheung","family":"So","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1975-0367131-6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.09.003"},{"key":"ref32","first-page":"1","article-title":"ALISTA: Analytic weights are as good as learned weights in LISTA","author":"liu","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref31","first-page":"9061","article-title":"Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds","author":"chen","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref30","first-page":"10","article-title":"Deep ADMM-net for compressive sensing MRI","author":"yang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"0","journal-title":"Proc 3rd Int Conf Learn Representations"},{"journal-title":"Statistical Estimation and Testing via the Ordered $\\ell _1$ Norm","year":"2013","author":"bogdan","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.2.231"},{"key":"ref10","first-page":"1215","article-title":"Orthogonal matching pursuit with replacement","author":"jain","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910971"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2416003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/110840364"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2412915"},{"key":"ref19","first-page":"37","article-title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems","author":"gong","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref28","first-page":"4340","article-title":"Maximal sparsity with deep networks?","author":"xin","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2330349"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392779"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2708040"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638791"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854221"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2014.6900763"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2015.7418403"},{"key":"ref26","first-page":"399","article-title":"Learning fast approximations of sparse coding","author":"gregor","year":"0","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2585096"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/8933520\/9025003-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09025003.pdf?arnumber=9025003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:33Z","timestamp":1651070493000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9025003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2978615","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2020]]}}}