{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T15:26:00Z","timestamp":1784388360969,"version":"3.55.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2015CB352502"],"award-info":[{"award-number":["2015CB352502"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61625301"],"award-info":[{"award-number":["61625301"]}],"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":["61731018"],"award-info":[{"award-number":["61731018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Microsoft Research Asia"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/jstsp.2018.2879185","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T00:24:27Z","timestamp":1542327867000},"page":"1405-1419","source":"Crossref","is-referenced-by-count":117,"title":["t-Schatten-$p$ Norm for Low-Rank Tensor Recovery"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3320-3747","authenticated-orcid":false,"given":"Hao","family":"Kong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8756-5981","authenticated-orcid":false,"given":"Xingyu","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1493-7569","authenticated-orcid":false,"given":"Zhouchen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"ADMM for multiaffine constrained optimization","author":"gao","year":"2018","journal-title":"arXiv 1802 09592"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2015.9.601"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.34"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-014-5469-5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref36","first-page":"339","article-title":"Provable models for robust low-rank tensor completion","volume":"11","author":"huang","year":"2015","journal-title":"Pacific J Optim"},{"key":"ref35","first-page":"620","article-title":"Tractable and scalable Schatten quasi-norm approximations for rank minimization","author":"shang","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033976"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"key":"ref11","author":"kruskal","year":"1989","journal-title":"Rank Decomposition and Uniqueness for 3-Way and N-Way Arrays"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3239"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9269-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref18","first-page":"1012","article-title":"Low-rank tensor completion: A Riemannian manifold preconditioning approach","author":"kasai","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46675-0_6"},{"key":"ref28","first-page":"655","article-title":"Low-rank matrix recovery via efficient Schatten $p$-norm minimization","author":"nie","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref27","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"rennie","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref6","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","first-page":"785","article-title":"A new theory for matrix completion","author":"liu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2553155"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref7","first-page":"1444","article-title":"Multilinear multitask learning","author":"romera-paredes","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref20","first-page":"2967","article-title":"A new convex relaxation for tensor completion","author":"romera-paredes","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref21","first-page":"1331","article-title":"Convex tensor decomposition via structured Schatten norm regularization","author":"tomioka","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","article-title":"Low-tubal-rank tensor completion using alternating minimization","volume":"9848","author":"liu","year":"0","journal-title":"Proc SPIE"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref25","first-page":"926","article-title":"A unified convex surrogate for the Schatten-$p$ norm","author":"xu","year":"0","journal-title":"Proc AAAI Conf Artif Intell"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/8566078\/08519632.pdf?arnumber=8519632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:29Z","timestamp":1641987809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8519632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":39,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2018.2879185","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}