{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T13:44:00Z","timestamp":1768311840402,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"16","license":[{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"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":["61603162"],"award-info":[{"award-number":["61603162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876074"],"award-info":[{"award-number":["61876074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Jiangxi Province","award":["20181ACE50029"],"award-info":[{"award-number":["20181ACE50029"]}]},{"name":"HKRGC","award":["16303817"],"award-info":[{"award-number":["16303817"]}]},{"name":"973 Program of China","award":["2015CB85600"],"award-info":[{"award-number":["2015CB85600"]}]},{"DOI":"10.13039\/501100001809","name":"NNSF of China","doi-asserted-by":"crossref","award":["61370004"],"award-info":[{"award-number":["61370004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NNSF of China","doi-asserted-by":"crossref","award":["11421110001"],"award-info":[{"award-number":["11421110001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,8,15]]},"DOI":"10.1109\/tsp.2019.2925609","type":"journal-article","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T14:12:56Z","timestamp":1562940776000},"page":"4261-4275","source":"Crossref","is-referenced-by-count":4,"title":["On Global Linear Convergence in Stochastic Nonconvex Optimization for Semidefinite Programming"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1719-3358","authenticated-orcid":false,"given":"Jinshan","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"685","article-title":"Barzilai-Borwein step size for stochastic gradient descent","author":"tan","year":"0","journal-title":"Proc 30th Annu Conf Neural Inf Process Syst"},{"key":"ref38","first-page":"144","article-title":"A stochastic PCA and SVD algorithm with an exponential convergence rate","volume":"37","author":"shamir","year":"0","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS400"},{"key":"ref32","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0451-1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref36","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","volume":"48","author":"reddi","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2448516"},{"key":"ref34","author":"nestrov","year":"1989","journal-title":"Self- concordant functions and polynomial time methods in convex programming"},{"key":"ref10","article-title":"Theory of convex optimization for machine learning","author":"bubeck","year":"2014"},{"key":"ref40","first-page":"864","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref13","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/110848074"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.09.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref17","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref19","first-page":"2332","article-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems","volume":"37","author":"sa","year":"0","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref28","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"0","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483308"},{"key":"ref27","first-page":"4527","article-title":"Provable efficient online matrix completion via nonconvex stochastic gradient descent","author":"jin","year":"0","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref3","first-page":"699","article-title":"Variance reduction for faster non-convex optimization","author":"allen-zhu","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref6","first-page":"1","article-title":"On the low-rank approach for semidefinite programs arising in synchronization and community detection","volume":"49","author":"bandeira","year":"0","journal-title":"Proc Int Conf Learn Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897548"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref8","author":"borg","year":"2005","journal-title":"Modern Multidimensional Scaling Theory and Applications"},{"key":"ref7","first-page":"530","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"0","journal-title":"Proc Int Conf Learn Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref1","first-page":"11","article-title":"Generalized non-metric multidimensional scaling","author":"agarwal","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref46","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"zheng","year":"0","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"key":"ref20","article-title":"The quest for ground truth in musical artist similarity","author":"ellis","year":"0","journal-title":"Proc 3rd Int Conf Music Inf Retrieval"},{"key":"ref45","article-title":"Stochastic variance-reduced gradient descent for low-rank matrix recovery from linear measurments","author":"zhang","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref42","first-page":"981","article-title":"A unified computational and statistical framework for nonconvex low-rank matrix estimation","volume":"54","author":"wang","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/17\/5\/053044"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2012.6349720"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371"},{"key":"ref44","article-title":"Finding global optima in nonconvex stochastic semidefinite optimization with variance reduction","author":"zeng","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1523097113"},{"key":"ref43","article-title":"A universal variance reduction-based catalyst for nonconvex low-rank matrix recovery","author":"wang","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8764374\/08752037.pdf?arnumber=8752037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:43Z","timestamp":1657746823000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8752037\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,15]]},"references-count":46,"journal-issue":{"issue":"16"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2019.2925609","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,15]]}}}