{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T15:59:00Z","timestamp":1782575940029,"version":"3.54.5"},"reference-count":48,"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":"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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071307"],"award-info":[{"award-number":["12071307"]}],"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":["11771003"],"award-info":[{"award-number":["11771003"]}],"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.3037996","type":"journal-article","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T20:58:03Z","timestamp":1605301083000},"page":"6594-6606","source":"Crossref","is-referenced-by-count":48,"title":["Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7232-9348","authenticated-orcid":false,"given":"Nan","family":"Meng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2388-9047","authenticated-orcid":false,"given":"Yun-Bin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"7650?7691","article-title":"A tight bound of hard thresholding","volume":"18","author":"shen","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/JRPROC.1949.232969","article-title":"Communication in the presence of noise","volume":"37","author":"shannon","year":"0","journal-title":"Proc IRE"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz027"},{"key":"ref31","first-page":"188","article-title":"IHT dies hard: Provable accelerated iterative hard thresholding","volume":"84","author":"khanna","year":"0","journal-title":"Proc AISTATS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2018.8553389"},{"key":"ref37","first-page":"1","article-title":"Compressive sensing and structured random matrices","author":"rauhut","year":"2010","journal-title":"Theoretical Foundations and Numerical Methods for Sparse Recovery"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACPR.2011.6166711"},{"key":"ref35","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511730344"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"877?905","DOI":"10.1007\/s00041-008-9045-x","article-title":"Enhancing sparsity by reweighted $\\ell _1$-minimization","volume":"14","author":"cand\u00e8s","year":"2008","journal-title":"J Fourier Anal Appl"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref15","first-page":"613?627","article-title":"Compressed sensing","volume":"41","author":"donoho","year":"1995","journal-title":"IEEE Trans Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.382009"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2337118"},{"key":"ref18","author":"donoho","year":"2006","journal-title":"Sparse solution of underdetermined linear equations by stagewise Orthogonal Matching Pursuit (StOMP)"},{"key":"ref19","first-page":"2816?2819","article-title":"Accelerated randomized coordinate descent iterative hard thresholding methods for $\\ell _0$-regularized convex problems","author":"ding","year":"0","journal-title":"Proc 35th Chin Control Conf"},{"key":"ref28","author":"han","year":"2013","journal-title":"Compressive Sensing for Wireless Networks"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.03.007"},{"key":"ref3","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"bhmani","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1660731"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref8","year":"0","journal-title":"Convex optimization"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2016.03.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2248414"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4171\/022-3\/69"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01529-7"},{"key":"ref46","first-page":"57?76","article-title":"Constructing new weighted $\\ell _1$-algorithms for the sparsest points of polyhedral sets","volume":"42","author":"zhao","year":"2016","journal-title":"Math Operations Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885522"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/110847445"},{"key":"ref48","article-title":"Global and quadratic convergence of Newton hard-thresholding pursuit","author":"zhou","year":"2020","journal-title":"arXiv 1901 02763"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref47","article-title":"Analysis of optimal thresholding algorithms for compressed sensing","author":"zhao","year":"2019","journal-title":"arXiv 1912 10258"},{"key":"ref21","year":"0","journal-title":"Sparse and Redundant Representations From Theory to Applications in Signal and Image Processing"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1049\/el.2019.1795"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/100806278"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.10.005"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/18M1219187"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1201\/9781315113142"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0772-0_5"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09258981.pdf?arnumber=9258981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:44Z","timestamp":1651070444000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9258981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.3037996","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}