{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:32Z","timestamp":1778815412314,"version":"3.51.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"TUBITAK","award":["115E917"],"award-info":[{"award-number":["115E917"]}]},{"DOI":"10.13039\/100000006","name":"U.S. Office of Naval Research (ONR) MURI","doi-asserted-by":"publisher","award":["N00014-16-1-2710"],"award-info":[{"award-number":["N00014-16-1-2710"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 11-11342"],"award-info":[{"award-number":["CCF 11-11342"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2017,10,1]]},"DOI":"10.1109\/tnse.2017.2713396","type":"journal-article","created":{"date-parts":[[2017,6,8]],"date-time":"2017-06-08T18:29:54Z","timestamp":1496946594000},"page":"248-260","source":"Crossref","is-referenced-by-count":47,"title":["Stochastic Subgradient Algorithms for Strongly Convex Optimization Over Distributed Networks"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5779-3986","authenticated-orcid":false,"given":"Muhammed O.","family":"Sayin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5271-8020","authenticated-orcid":false,"given":"N. Denizcan","family":"Vanli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suleyman S.","family":"Kozat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamer","family":"Basar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"612","article-title":"Asymptotic agreement and convergence of asynchronous stochastic algorithms","volume":"ac 32","author":"li","year":"1987","journal-title":"IEEE Trans Autom Control"},{"key":"ref38","article-title":"Linear time average consensus on fixed graphs and implications for\n decentralized optimization and multi-agent control","author":"olshevsky","year":"2016"},{"key":"ref33","first-page":"2489","article-title":"Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex\n optimization","volume":"15","author":"hazan","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483272"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref35","author":"luenberger","year":"1969","journal-title":"Optimization by vector space methods"},{"key":"ref34","article-title":"A simpler approach to obtaining an ${O}(1\/t)$\n convergence rate for the\n projected stochastic subgradient method","author":"lacoste-julien","year":"2012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2331615"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917383"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2033729"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2333560"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2296271"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2412918"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2204985"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2217338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2246763"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2055862"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2231991"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2194290"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2306253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2114324"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657815"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9737-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2091295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2015.2503983"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2415755"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2415759"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2327238"},{"key":"ref23","first-page":"449","article-title":"Making\n gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2024278"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016226"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/6488902\/8125790\/7944588-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/8125790\/07944588.pdf?arnumber=7944588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:55Z","timestamp":1649444035000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7944588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,1]]},"references-count":39,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2017.2713396","relation":{},"ISSN":["2327-4697"],"issn-type":[{"value":"2327-4697","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10,1]]}}}