{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T05:26:46Z","timestamp":1745645206580,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1135005","61305018","61432008","61472423","61532006"],"award-info":[{"award-number":["U1135005","61305018","61432008","61472423","61532006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Post-Graduate Scientific Research Innovation Program of Jiangsu Province","award":["KYZZ15_0123"],"award-info":[{"award-number":["KYZZ15_0123"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/tnnls.2016.2514413","type":"journal-article","created":{"date-parts":[[2016,1,22]],"date-time":"2016-01-22T21:30:14Z","timestamp":1453498214000},"page":"438-450","source":"Crossref","is-referenced-by-count":4,"title":["Learning a Coupled Linearized Method in Online Setting"],"prefix":"10.1109","volume":"28","author":[{"given":"Wei","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"ref38","first-page":"2116","article-title":"Dual averaging method for regularized stochastic learning and online optimization","author":"xiao","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02256-2_42"},{"key":"ref32","first-page":"392","article-title":"Dual averaging and proximal gradient descent for online alternating direction multiplier method","author":"suzuki","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-009-0179-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-010-0357-3"},{"key":"ref37","first-page":"1119","article-title":"Online alternating direction method","author":"wang","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Roy Statist Soc Series B (Methodol )"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2294741"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref12"},{"key":"ref13","first-page":"41","article-title":"Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de Dirichlet non linéaires","volume":"9","author":"glowinski","year":"1975","journal-title":"Rev Fr Autom Inform Rech Opér Anal numér"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/120896219"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.19139\/106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"journal-title":"Smooth Hinge Classification","year":"2005","author":"rennie","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref27","first-page":"1435","article-title":"Structured sparsity via alternating direction methods","volume":"13","author":"qin","year":"2012","journal-title":"J Mach Learn Res"},{"journal-title":"Pattern Recognition and Machine Learning","year":"2006","author":"bishop","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"article-title":"Splitting methods in image processing","year":"2009","author":"setzer","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref8","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.19139\/122"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref9","first-page":"2899","article-title":"Efficient online and batch learning using forward backward splitting","volume":"10","author":"duchi","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2320291"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116827"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref22","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref47","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094829-4.50022-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.02.025"},{"key":"ref24","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $O(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/080732894"},{"key":"ref23","first-page":"339","article-title":"Multi-task feature learning via efficient $\\ell _{2,1}$ -norm minimization","author":"liu","year":"2009","journal-title":"Proc 25th Conf Uncertainty Artif Intell"},{"key":"ref44","first-page":"352","article-title":"Efficient methods for overlapping group lasso","author":"yuan","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"80","article-title":"Stochastic alternating direction method of multipliers","author":"ouyang","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref43","first-page":"3183","article-title":"A comparison of optimization methods and software for large-scale ${\\ell_{1}}$ -regularized linear classification","volume":"11","author":"yuan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/7823058\/07390084.pdf?arnumber=7390084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T22:58:04Z","timestamp":1718319484000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7390084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":47,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2016.2514413","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}