{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:49:45Z","timestamp":1753602585942,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1254218"],"award-info":[{"award-number":["CCF-1254218"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3229644","type":"journal-article","created":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T19:50:38Z","timestamp":1671133838000},"page":"5940-5953","source":"Crossref","is-referenced-by-count":6,"title":["On Local Linear Convergence Rate of Iterative Hard Thresholding for Matrix Completion"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2180-5994","authenticated-orcid":false,"given":"Trung","family":"Vu","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA"}]},{"given":"Evgenia","family":"Chunikhina","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Pacific University, Forest Grove, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9711-5709","authenticated-orcid":false,"given":"Raviv","family":"Raich","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"720","article-title":"Weighted low-rank approximations","volume-title":"Proc. 20th Int. Conf. Mach. Learn","author":"Srebro","year":"2003"},{"key":"ref2","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Srebro","year":"2005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2008.86"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531594"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2013.04.005"},{"key":"ref8","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wright","year":"2009"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"issue":"3","key":"ref12","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"Toh","year":"2010","journal-title":"Pacific J. Optim."},{"key":"ref13","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jaggi","year":"2013"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461515"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/15M1035793"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref19","first-page":"3345","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ma","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","year":"2015","author":"Chen","key":"ref21"},{"key":"ref22","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jain","year":"2010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iav011"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2014.6884658"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683082"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682312"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"article-title":"On convergence of the alternating projection method for matrix completion and sparse recovery problems","year":"2017","author":"Lai","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9084-6"},{"key":"ref32","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","volume-title":"Proc. Conf. Learn. Theory","author":"Jain","year":"2015"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2021.05.020"},{"key":"ref35","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables","volume":"55","author":"Abramowitz","year":"964"},{"volume-title":"Stability Theory of Differential Equations","year":"2008","author":"Bellman","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-022-01893-7"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3192142"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2016.7551726"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000236"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345134"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.2004.53.2325"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-005-0428-5"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/39\/22\/004"},{"issue":"6","key":"ref46","doi-asserted-by":"crossref","DOI":"10.1214\/08-AOS605","volume":"36","author":"Johnstone","year":"2008","journal-title":"Ann. Statist."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/33\/10\/307"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-008-0146-x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1063\/1.3672885"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344370"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1142\/S201032631550001X"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1117\/1.1455013"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9675017\/9987701-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09987701.pdf?arnumber=9987701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:31:18Z","timestamp":1706769078000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9987701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3229644","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2022]]}}}