{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:34:32Z","timestamp":1775280872215,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"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 Signal Process. Mag."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/msp.2014.2345536","type":"journal-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T18:30:12Z","timestamp":1413311412000},"page":"124-129","source":"Crossref","is-referenced-by-count":37,"title":["Stochastic Approximation vis-a-vis Online Learning for Big Data Analytics [Lecture Notes]"],"prefix":"10.1109","volume":"31","author":[{"given":"Konstantinos","family":"Slavakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung-Jun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref12","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"0","journal-title":"Proc Conf Learning Theory"},{"key":"ref13","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":"ref14","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"0","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref4","author":"bertsekas","year":"1997","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2696-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144593251710"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016226"},{"key":"ref8","author":"needell","year":"2013","journal-title":"Stochastic gradient descent and the randomized Kaczmarz algorithm"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2327238"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362111"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/6923515\/06923526.pdf?arnumber=6923526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:16Z","timestamp":1642005076000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6923526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":14,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/msp.2014.2345536","relation":{},"ISSN":["1053-5888"],"issn-type":[{"value":"1053-5888","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}