{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:32:59Z","timestamp":1770748379881,"version":"3.49.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":["62025103"],"award-info":[{"award-number":["62025103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20232038"],"award-info":[{"award-number":["GZC20232038"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3378004","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T20:28:31Z","timestamp":1710793711000},"page":"1590-1606","source":"Crossref","is-referenced-by-count":9,"title":["Projected Gradient Descent for Spectral Compressed Sensing via Symmetric Hankel Factorization"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0296-6945","authenticated-orcid":false,"given":"Jinsheng","family":"Li","sequence":"first","affiliation":[{"name":"School of Information and Electronics, Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8532-8328","authenticated-orcid":false,"given":"Wei","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Information and Electronics, Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1629-2103","authenticated-orcid":false,"given":"Xu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Xidian University, Xi’an, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037526"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034811"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.21391"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.906657"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343623"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/17M1141394"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.04.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3067738"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277451"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(99)00199-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1117\/12.284193"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01651436"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-022-00217-1"},{"key":"ref17","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"Zheng"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2007.05.027"},{"key":"ref19","article-title":"A fast alternating projection method for complex frequency estimation","author":"Andersson"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050525"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2020011"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10096359"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3209006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109274"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2172457"},{"key":"ref26","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"Chen","year":"2015"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/060661569"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.06.046"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2015.7322458"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.12.003"},{"key":"ref32","first-page":"797","article-title":"Nearly optimal robust matrix completion","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cherapanamjeri","year":"2017"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2827299"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2904021"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.01.170"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542512010034"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045493"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3021338"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICUPC.1996.562649"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.2991\/jimec-17.2017.79"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2038977"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3051425"},{"key":"ref46","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/10347386\/10474161.pdf?arnumber=10474161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T18:10:15Z","timestamp":1722363015000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10474161\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3378004","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}