{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T04:00:19Z","timestamp":1784779219279,"version":"3.55.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"13","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CCF-1409261"],"award-info":[{"award-number":["CCF-1409261"]}]},{"name":"NSF","award":["CCF-1704204"],"award-info":[{"award-number":["CCF-1704204"]}]},{"name":"NSF","award":["CCF-1149225"],"award-info":[{"award-number":["CCF-1149225"]}]},{"name":"DARPA Lagrange Program under ONR\/SPAWAR","award":["N660011824020"],"award-info":[{"award-number":["N660011824020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1109\/tsp.2018.2835403","type":"journal-article","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T18:43:33Z","timestamp":1525977813000},"page":"3614-3628","source":"Crossref","is-referenced-by-count":83,"title":["Global Optimality in Low-Rank Matrix Optimization"],"prefix":"10.1109","volume":"66","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","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":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620109"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.7916\/D8251J7H"},{"key":"ref32","first-page":"1246","article-title":"Gradient descent converges to minimizers","volume":"1050","author":"lee","year":"2016","journal-title":"Univ California Berkeley"},{"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 Int Conf Mach Learn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref36","first-page":"530","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref28","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0435-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2007.0113"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309166"},{"key":"ref20","first-page":"65","article-title":"Non-square matrix sensing without\n spurious local minima via the Burer-Monteiro approach","author":"park","year":"2017","journal-title":"Proc Artif Intell Stat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541725"},{"key":"ref21","first-page":"981","article-title":"A unified\n computational and statistical framework for nonconvex low-rank matrix estimation","author":"wang","year":"2017","journal-title":"Proc Artif Intell Stat"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000055"},{"key":"ref23","first-page":"797","article-title":"Escaping from saddle points—Online stochastic\n gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1201\/b20190"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586753"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2004.1384521"},{"key":"ref40","article-title":"Symmetry, saddle points, and global\n geometry of nonconvex matrix factorization","author":"li","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248078"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531594"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref18","first-page":"3873","article-title":"Global\n optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"2973","article-title":"Matrix completion has no\n spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/9\/095022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984630"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143876"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2161471"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2015.7086879"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/110820361"},{"key":"ref48","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00243-3"},{"key":"ref42","first-page":"1233","article-title":"No spurious local minima in\n nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017"},{"key":"ref41","article-title":"The global optimization geometry of nonsymmetric matrix\n factorization and sensing","author":"zhu","year":"2017"},{"key":"ref44","first-page":"720","article-title":"Weighted low-rank approximations","volume":"3","author":"srebro","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/78\/8369162\/8357489-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8369162\/08357489.pdf?arnumber=8357489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:00Z","timestamp":1649443740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8357489\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":51,"journal-issue":{"issue":"13"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2835403","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}