{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:29:27Z","timestamp":1755217767212,"version":"3.43.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"City University of Hong Kong (CityU) Shenzhen Research Institute","award":["12371297"],"award-info":[{"award-number":["12371297"]}]},{"name":"Hong Kong Research Grants Council (RGC) General Research Fund","award":["11300721","11311822","11300424"],"award-info":[{"award-number":["11300721","11311822","11300424"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tip.2025.3588719","type":"journal-article","created":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:32:35Z","timestamp":1753813955000},"page":"4806-4813","source":"Crossref","is-referenced-by-count":0,"title":["Decentralized Nonconvex Low-rank Matrix Recovery"],"prefix":"10.1109","volume":"34","author":[{"given":"Junzhuo","family":"Gao","sequence":"first","affiliation":[{"name":"Department of Mathematics, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6008-6614","authenticated-orcid":false,"given":"Heng","family":"Lian","sequence":"additional","affiliation":[{"name":"Department of Mathematics, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref2","first-page":"471","article-title":"A simple algorithm for nuclear norm regularized problems","volume-title":"Proc. ICML","author":"Jaggi"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995369"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000055"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref8","first-page":"674","article-title":"Coherent matrix completion","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSRE.2019.2913142"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107204"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3212390"},{"key":"ref12","first-page":"600","article-title":"Low-rank and sparse structure pursuit via alternating minimization","volume-title":"Proc. 19th Int. Conf. Artif. Intell. Statist.","author":"Gu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045493"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150189"},{"key":"ref16","first-page":"1","article-title":"Non-convex projected gradient descent for generalized low-rank tensor regression","volume":"20","author":"Chen","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref18","first-page":"685","article-title":"On iterative hard thresholding methods for high-dimensional M-estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Jain"},{"key":"ref19","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Zhao"},{"key":"ref20","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zheng"},{"key":"ref21","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Lian"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926022"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3031071"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303791"},{"key":"ref25","article-title":"High-dimensional inference over networks: Linear convergence and statistical guarantees","author":"Sun","year":"2022","journal-title":"arXiv:2201.08507"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/20M1361158"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3275927"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3166\/EJC.18.539-557"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS400"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3090652"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029217"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/83\/10795784\/11099596.pdf?arnumber=11099596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T18:08:48Z","timestamp":1754417328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11099596\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/tip.2025.3588719","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2025]]}}}