{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T04:00:16Z","timestamp":1784779216576,"version":"3.55.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1409261"],"award-info":[{"award-number":["CCF-1409261"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1464205"],"award-info":[{"award-number":["CCF-1464205"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2008460"],"award-info":[{"award-number":["2008460"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER CCF-1149225"],"award-info":[{"award-number":["CAREER CCF-1149225"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"DARPA Lagrange Program","doi-asserted-by":"publisher","award":["N660011824020"],"award-info":[{"award-number":["N660011824020"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tit.2021.3049171","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T23:11:29Z","timestamp":1609888289000},"page":"1308-1331","source":"Crossref","is-referenced-by-count":34,"title":["The Global Optimization Geometry of Low-Rank Matrix Optimization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3856-0375","authenticated-orcid":false,"given":"Zhihui","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2306-6649","authenticated-orcid":false,"given":"Qiuwei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7879-1338","authenticated-orcid":false,"given":"Gongguo","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2165-4586","authenticated-orcid":false,"given":"Michael B.","family":"Wakin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay003"},{"key":"ref38","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"zhao","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref32","first-page":"981","article-title":"A unified computational and statistical framework for nonconvex low-rank matrix estimation","author":"wang","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref31","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/16M110109X"},{"key":"ref37","first-page":"530","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref36","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume":"70","author":"ge","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref34","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref27","first-page":"123","article-title":"Learning sparsely used overcomplete dictionaries","author":"agarwal","year":"2014","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632149"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2007.0113"},{"key":"ref20","first-page":"2727","article-title":"How to escape saddle points efficiently","author":"jin","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref21","first-page":"3935","article-title":"Alternating minimizations converge to second-order optimal solutions","author":"li","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref24","first-page":"739","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2840711"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref52","first-page":"8422","article-title":"Distributed low-rank matrix factorization with exact consensus","author":"zhu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref13","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","first-page":"65","article-title":"Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach","author":"park","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref16","first-page":"797","article-title":"Escaping from saddle points—Online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref17","article-title":"When are nonconvex problems not scary?","author":"sun","year":"2015","journal-title":"arXiv 1510 06096"},{"key":"ref18","first-page":"1246","article-title":"Gradient descent converges to minimizers","author":"lee","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref19","first-page":"1","article-title":"Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions","author":"panageas","year":"2017","journal-title":"Proc 8th Innov Theor Comput Sci Conf (ITCS)"},{"key":"ref4","first-page":"3585","article-title":"Dynamic matrix recovery from incomplete observations under an exact low-rank constraint","author":"xu","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2004.1384521"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248078"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0435-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"ref48","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2200000055"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898663"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref43","author":"chirikjian","year":"2016","journal-title":"Harmonic Analysis for Engineers and Applied Scientists Updated and Expanded Edition"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9333790\/9314092-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9333790\/09314092.pdf?arnumber=9314092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:16Z","timestamp":1652194456000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9314092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":52,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3049171","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}