{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:14:57Z","timestamp":1759940097859},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst., Man, Cybern. B"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tsmcb.2011.2163506","type":"journal-article","created":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T19:56:59Z","timestamp":1314907019000},"page":"140-149","source":"Crossref","is-referenced-by-count":10,"title":["Developing Learning Algorithms via Optimized Discretization of Continuous Dynamical Systems"],"prefix":"10.1109","volume":"42","author":[{"family":"Qing Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zhengya Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Kang Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"905","article-title":"Sparse online learning via truncated gradient","author":"langford","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970432"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/060655183"},{"key":"ref13","author":"miller","year":"1980","journal-title":"Ordinary Differential Equations"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(01)00542-4"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/72.914536","article-title":"A novel continuous-time neural network for realizing associative memory","volume":"12","author":"tao","year":"2001","journal-title":"IEEE Trans Neural Netw"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281270"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2004.824252"},{"key":"ref4","first-page":"272","article-title":"Efficient projections onto the <ref_formula><tex Notation=\"TeX\">$l_{1}$<\/tex><\/ref_formula>-ball for learning in high dimensions","author":"duchi","year":"2008","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","first-page":"1737","article-title":"SGD-QN: Careful quasi-newton stochastic gradient descent","volume":"10","author":"bordes","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref6","first-page":"2157","article-title":"Optimized cutting plane algorithm for large-scale risk minimization","volume":"10","author":"franc","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/11776420_37","article-title":"Logarithmic regret algorithms for online convex optimization","author":"hazan","year":"2006","journal-title":"Proc Ann Conf Learning Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11571-008-9036-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390208"},{"key":"ref2","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511618260"},{"key":"ref9","author":"kinderlerer","year":"1980","journal-title":"An Introduction to Variational Inequalities and Their Applications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2004.839913"},{"key":"ref22","first-page":"3183","article-title":"A comparison of optimization methods for large-scale l1-regularized linear classification","volume":"11","author":"yuan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref21","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref24","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3477\/6129833\/06006539.pdf?arnumber=6006539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:48:12Z","timestamp":1633909692000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6006539\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":24,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tsmcb.2011.2163506","relation":{},"ISSN":["1083-4419","1941-0492"],"issn-type":[{"value":"1083-4419","type":"print"},{"value":"1941-0492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}