{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:55:32Z","timestamp":1740178532939,"version":"3.37.3"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Project","award":["ECCS-1933027"],"award-info":[{"award-number":["ECCS-1933027"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/lcsys.2020.3016626","type":"journal-article","created":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T20:51:14Z","timestamp":1597351874000},"page":"1139-1144","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7333-6291","authenticated-orcid":false,"given":"Rui","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5852-9789","authenticated-orcid":false,"given":"Alex","family":"Olshevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339612"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2576979"},{"key":"ref13","first-page":"3335","article-title":"Gradient descent for sparse rank-one matrix completion for crowd-sourced aggregation of sparsely interacting workers","author":"ma","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","first-page":"1","article-title":"Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis","volume":"21","author":"fattahi","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"3426","article-title":"Minimax rank-1 matrix factorization","author":"saligrama","year":"2020","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1582620"},{"key":"ref17","volume":"385","author":"jungers","year":"2009","journal-title":"The Joint Spectral Radius Theory and Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/110837462"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2257969"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"article-title":"Sparse nonnegative matrix factorization for clustering","year":"2008","author":"kim","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref2","first-page":"1","volume":"81","author":"koren","year":"2009","journal-title":"The Bellkor Solution to the Netflix Grand Prize"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/9162156\/9166551-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/9162156\/09166551.pdf?arnumber=9166551","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:20Z","timestamp":1652194460000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9166551\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":19,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcsys.2020.3016626","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}