{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:43:52Z","timestamp":1775544232287,"version":"3.50.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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":["61673015"],"award-info":[{"award-number":["61673015"]}],"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":["61976181"],"award-info":[{"award-number":["61976181"]}],"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":["11931015"],"award-info":[{"award-number":["11931015"]}],"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":["61971296"],"award-info":[{"award-number":["61971296"]}],"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":["U19A2078"],"award-info":[{"award-number":["U19A2078"]}],"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":["61976181"],"award-info":[{"award-number":["61976181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["XDJK2019B063"],"award-info":[{"award-number":["XDJK2019B063"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["SWU120036"],"award-info":[{"award-number":["SWU120036"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2019jcyjjqX0013"],"award-info":[{"award-number":["cstc2019jcyjjqX0013"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chongqing Research Program of Technology Innovation and Application","award":["cstc2019jscx-fxydX0024"],"award-info":[{"award-number":["cstc2019jscx-fxydX0024"]}]},{"name":"Chongqing Research Program of Technology Innovation and Application","award":["cstc2019jscx-fxydX0027"],"award-info":[{"award-number":["cstc2019jscx-fxydX0027"]}]},{"name":"Chongqing Research Program of Technology Innovation and Application","award":["cstc2018jszx-cyzdX0041"],"award-info":[{"award-number":["cstc2018jszx-cyzdX0041"]}]},{"name":"CAAIHuawei MindSpore Open Fund","award":["CAAIXSJLJJ-2020-004B"],"award-info":[{"award-number":["CAAIXSJLJJ-2020-004B"]}]},{"DOI":"10.13039\/501100002367","name":"Pioneer Hundred Talents Program of Chinese Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002367","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":[[2022,9]]},"DOI":"10.1109\/tnnls.2021.3059711","type":"journal-article","created":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T21:34:38Z","timestamp":1614634478000},"page":"4661-4675","source":"Crossref","is-referenced-by-count":37,"title":["Large-Scale Affine Matrix Rank Minimization With a Novel Nonconvex Regularizer"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2167-830X","authenticated-orcid":false,"given":"Zhi","family":"Wang","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0139-0536","authenticated-orcid":false,"given":"Yu","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Adelaide, Adelaide, SA, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1348-5305","authenticated-orcid":false,"given":"Xin","family":"Luo","sequence":"additional","affiliation":[{"name":"Chongqing Engineering Research Center of Big Data Application for Smart Cities, Chinese Academy of Sciences, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5344-4460","authenticated-orcid":false,"given":"Jianjun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5865-2285","authenticated-orcid":false,"given":"Chao","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0987-8472","authenticated-orcid":false,"given":"Dezhong","family":"Peng","sequence":"additional","affiliation":[{"name":"College of Computer Science, Sichuan University, Chengdu, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5041-6122","authenticated-orcid":false,"given":"Wu","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2415257"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2608834"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2903736"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2685521"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2766528"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"issue":"3","key":"ref12","first-page":"615","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_205090"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2900572"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2018.08.021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref21","first-page":"1081","article-title":"Analysis of muti-stage convex relaxation for sparse regularization","volume":"11","author":"Zhang","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/153244303322753751"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2858249"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"issue":"2","key":"ref28","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate $O(1\/k^{2})$","volume":"27","author":"Nesterov","year":"1983","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref29","first-page":"1458","article-title":"Convergence rates of inexact proximal gradient methods for convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Schmidt"},{"key":"ref30","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11802"},{"key":"ref32","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/462"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9464"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2677440"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2012.10.006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/130934271"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2197412"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.10.065"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2851957"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/21m1395685"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref46","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"Mazumder","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref48","first-page":"37","article-title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Gong"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/07070111x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref52","first-page":"458","article-title":"Better approximation and faster algorithm using the proximal average","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8994"},{"key":"ref54","first-page":"7035","article-title":"Efficient nonconvex regularized tensor completion with structure-aware proximal iterations","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Yao"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2766160"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2886712"},{"key":"ref58","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Meka"},{"key":"ref59","first-page":"1","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wright"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10886"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2867533"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9872163\/09366347.pdf?arnumber=9366347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:45:20Z","timestamp":1704843920000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9366347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":63,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2021.3059711","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}