{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T21:04:40Z","timestamp":1778619880120,"version":"3.51.4"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tit.2019.2959980","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:48:26Z","timestamp":1576543706000},"page":"1714-1737","source":"Crossref","is-referenced-by-count":70,"title":["Low-Tubal-Rank Tensor Completion Using Alternating Minimization"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9532-1709","authenticated-orcid":false,"given":"Xiao-Yang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1049-9795","authenticated-orcid":false,"given":"Shuchin","family":"Aeron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2861","article-title":"The noisy power method: A meta algorithm with applications","author":"hardt","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1845"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref31","article-title":"Tensor ring decomposition","author":"zhao","year":"2016","journal-title":"arXiv 1606 05535"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1190\/geo2014-0467.1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8423008"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref34","first-page":"638","article-title":"Fast matrix completion without the condition number","author":"hardt","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref27","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1197448"},{"key":"ref1","article-title":"Low-tubal-rank tensor completion using alternating minimization","volume":"9848","author":"liu","year":"2016","journal-title":"Proc SPIE"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2018.8486609"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/110820361"},{"key":"ref51","article-title":"Fast computation of Moore-Penrose inverse matrices","author":"courrieu","year":"2008","journal-title":"arXiv 0804 4809"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.607"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1859995.1860015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2639108.2639129"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.05.025"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566962"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2345257"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2763170"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5366-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref6","author":"little","year":"2014","journal-title":"Statistical Analysis with Missing Data"},{"key":"ref5","article-title":"Tensor completion algorithms in big data analytics","author":"song","year":"2017","journal-title":"arXiv 1711 10105"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2505729"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2015.12"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030287"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592600"},{"key":"ref46","author":"matousek","year":"2001","journal-title":"Lectures on Discrete Geometry"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref47","year":"2016","journal-title":"Video Results"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2016.7818429"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.25"},{"key":"ref44","first-page":"1012","article-title":"Low-rank tensor completion: A Riemannian manifold preconditioning approach","author":"kasai","year":"2016","journal-title":"Proc ACM ICML"},{"key":"ref43","first-page":"1431","article-title":"Provable tensor factorization with missing data","author":"jain","year":"2014","journal-title":"Proceedings of ACM NIPS"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8999759\/08933136.pdf?arnumber=8933136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:30:02Z","timestamp":1651080602000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8933136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":52,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2959980","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}