{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T23:38:59Z","timestamp":1785800339858,"version":"3.56.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["69972036"],"award-info":[{"award-number":["69972036"]}],"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":["61772389"],"award-info":[{"award-number":["61772389"]}],"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":["61906144"],"award-info":[{"award-number":["61906144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M663639"],"award-info":[{"award-number":["2019M663639"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central University","doi-asserted-by":"publisher","award":["JB190704"],"award-info":[{"award-number":["JB190704"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/tnnls.2020.2985850","type":"journal-article","created":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T16:00:46Z","timestamp":1588694446000},"page":"1627-1641","source":"Crossref","is-referenced-by-count":11,"title":["Generalized Unitarily Invariant Gauge Regularization for Fast Low-Rank Matrix Recovery"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-4780-2900","authenticated-orcid":false,"given":"Xixi","family":"Jia","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3463-2060","authenticated-orcid":false,"given":"Xiangchu","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiwei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi’an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-2078-4215","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref38","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"zhao","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","article-title":"Unified scalable equivalent formulations for schatten quasi-norms","author":"shang","year":"2016","journal-title":"arXiv 1606 00668"},{"key":"ref32","first-page":"2016","article-title":"Scalable algorithms for tractable schatten quasi-norm minimization","author":"shang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref30","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/130934271"},{"key":"ref36","first-page":"1297","article-title":"Practical large-scale optimization for max-norm regularization","author":"lee","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref34","article-title":"Convex relaxations of structured matrix factorizations","author":"bach","year":"2013"},{"key":"ref28","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/110840364"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/TNNLS.2015.2496964","article-title":"$L_{1}$\n-norm low-rank matrix decomposition by neural networks and mollifiers","volume":"27","author":"liu","year":"2016","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2376530"},{"key":"ref22","first-page":"620","article-title":"Tractable and scalable schatten quasi-norm approximations for rank minimization","author":"shang","year":"2016","journal-title":"Proc Artif Intell Statist"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2611525"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250577"},{"key":"ref26","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010","journal-title":"ArXiv 1009 5055"},{"key":"ref25","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref51","volume":"169","author":"bhatia","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref52","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref14","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"hastie","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref16","first-page":"926","article-title":"A unified convex surrogate for the Schatten-p norm","author":"xu","year":"2017","journal-title":"Proc AAAI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2608834"},{"key":"ref4","first-page":"853","article-title":"A unified approach to salient object detection via low rank matrix recovery","author":"shen","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.25"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2016.05.026"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2597444"},{"key":"ref7","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","first-page":"1410","article-title":"Practical low-rank matrix approximation under robust L1-norm","author":"zheng","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref46","first-page":"1412","article-title":"Cur algorithm for partially observed matrices","author":"xu","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref45","article-title":"Large-scale low-rank matrix learning with nonconvex regularizers","author":"yao","year":"2017","journal-title":"arXiv 1708 00146"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.160"},{"key":"ref47","first-page":"55","article-title":"Robust principal component analysis with complex noise","author":"zhao","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","first-page":"173","article-title":"The convex analysis of unitarily invariant matrix functions","volume":"2","author":"lewis","year":"1995","journal-title":"J Convex Anal"},{"key":"ref44","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","first-page":"4002","article-title":"Accelerated inexact soft-impute for fast large-scale matrix completion","author":"yao","year":"2015","journal-title":"Proc 24th Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/5962385\/9394817\/09086898.pdf?arnumber=9086898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T18:33:43Z","timestamp":1753986823000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/9086898\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":52,"journal-issue":{"issue":"4"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tnnls.2020.2985850","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}