{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:19:17Z","timestamp":1778631557490,"version":"3.51.4"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Fund of China","award":["U1713208"],"award-info":[{"award-number":["U1713208"]}]},{"name":"National Science Fund of China","award":["61876083"],"award-info":[{"award-number":["61876083"]}]},{"name":"National Science Fund of China","award":["61602246"],"award-info":[{"award-number":["61602246"]}]},{"name":"National Science Fund of China","award":["61602244"],"award-info":[{"award-number":["61602244"]}]},{"name":"Program for Changjiang Scholars"},{"name":"National Science Fund of Jiangsu Province","award":["BK20171430"],"award-info":[{"award-number":["BK20171430"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tnnls.2019.2900572","type":"journal-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T18:20:53Z","timestamp":1552933253000},"page":"2916-2925","source":"Crossref","is-referenced-by-count":50,"title":["Efficient Recovery of Low-Rank Matrix via Double Nonconvex Nonsmooth Rank Minimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2472-6637","authenticated-orcid":false,"given":"Hengmin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4092-9856","authenticated-orcid":false,"given":"Chen","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0968-8556","authenticated-orcid":false,"given":"Jianjun","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2497-9519","authenticated-orcid":false,"given":"Bob","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0814-4362","authenticated-orcid":false,"given":"Chunyan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4800-832X","authenticated-orcid":false,"given":"Jian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2885699"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1993.10485033"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2811764"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijforecast.2012.05.001"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1993-1181163-6"},{"key":"ref28","first-page":"1764","article-title":"Nonconvex relaxation approaches to robust matrix recovery","author":"wang","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref1","first-page":"720","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.156"},{"key":"ref21","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2481325"},{"key":"ref23","first-page":"7008","article-title":"Robust collaborative discriminative learning for RGB-infrared tracking","author":"lan","year":"2018","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref26","author":"lin","year":"2010","journal-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2777183"},{"key":"ref50","author":"border","year":"2001","journal-title":"The Supergradient of A Concave Function"},{"key":"ref51","author":"rockafellar","year":"2004","journal-title":"Variational Analysis"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000200"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","article-title":"Optimization transfer using surrogate objective functions","volume":"9","author":"lange","year":"2000","journal-title":"J Comput Graph Statist"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2573644"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.02.025"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250577"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.34"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90211-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2376530"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2633275"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0449"},{"key":"ref12","first-page":"655","article-title":"Low-rank matrix recovery via efficient schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell (AAAI)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0713-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref16","first-page":"1805","article-title":"Generalized singular value thresholding","author":"lu","year":"2015","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2599290"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00369"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53547-0_3"},{"key":"ref5","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.06.011"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0905"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2192742"},{"key":"ref45","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2608834"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2817538"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2012.10.006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8844334\/08668706.pdf?arnumber=8668706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T22:04:51Z","timestamp":1721081091000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8668706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":60,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2019.2900572","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}