{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:42:27Z","timestamp":1773801747130,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9029798","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:43:11Z","timestamp":1584060191000},"page":"7435-7440","source":"Crossref","is-referenced-by-count":17,"title":["On Primal and Dual Approaches for Distributed Stochastic Convex Optimization over Networks"],"prefix":"10.1109","author":[{"given":"Darina","family":"Dvinskikh","sequence":"first","affiliation":[]},{"given":"Eduard","family":"Gorbunov","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[]},{"given":"Cesar A.","family":"Uribe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"ref38","first-page":"1367","article-title":"Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm","volume":"80","author":"dvurechensky","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref33","first-page":"2745","article-title":"Optimal algorithms for non-smooth distributed optimization in networks","author":"scaman","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref32","article-title":"Optimal distributed optimization on slowly time-varying graphs","author":"rogozin","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)00002-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_31"},{"key":"ref35","first-page":"584","article-title":"Primal-dual method for searching equilibrium in hierarchical congestion population games","author":"dvurechensky","year":"2016","journal-title":"Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619626"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1134\/S1995423918010044"},{"key":"ref11","first-page":"3243","article-title":"Tensorflow: Largescale machine learning on heterogeneous distributed systems","author":"abadi","year":"2016","journal-title":"Language Resources and Evaluation Conf (LREC)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"5538","DOI":"10.1109\/TAC.2017.2690401","article-title":"Fast convergence rates for distributed non-Bayesian learning","volume":"62","author":"nedi?","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"ref15","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"Journal of Optimization Theory and Applications"},{"key":"ref16","first-page":"3027","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref17","article-title":"A dual approach for optimal algorithms in distributed optimization over networks","author":"uribe","year":"2018"},{"key":"ref18","first-page":"1","article-title":"Communication-efficient algorithms for decentralized and stochastic optimization","author":"lan","year":"2017","journal-title":"Mathematical Programming"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619228"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/110848876"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9080-1"},{"key":"ref27","first-page":"4914","article-title":"Learning supervised pagerank with gradient-based and gradient-free optimization methods","author":"bogolubsky","year":"2016","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref6","first-page":"2","article-title":"Mlbase: A distributed machine-learning system","volume":"1","author":"kraska","year":"2013","journal-title":"CIDR"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0999-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326696"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.21469\/22233792.4.4.05"},{"key":"ref7","article-title":"Distributed learning for cooperative inference","author":"nedi?","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1984.1103385"},{"key":"ref9","first-page":"177","author":"bottou","year":"2010","journal-title":"Proc COMPSTAT"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102982"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262868"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref21","article-title":"On dual approach for distributed stochastic convex optimization over networks","author":"dvinskikh","year":"2019"},{"key":"ref42","first-page":"3530","article-title":"On the complexity of approximating Wasserstein barycenters","volume":"97","author":"kroshnin","year":"2019","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032600"},{"key":"ref23","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o(1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref44","first-page":"10783","article-title":"Decentralize and randomize: Faster algorithm for Wasserstein barycenters","author":"dvurechensky","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22629-9_8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619160"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","location":"Nice, France","start":{"date-parts":[[2019,12,11]]},"end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09029798.pdf?arnumber=9029798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:20:53Z","timestamp":1658247653000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9029798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9029798","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}