{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:38:46Z","timestamp":1768340326797,"version":"3.49.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:00:00Z","timestamp":1544140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:00:00Z","timestamp":1544140800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1637473"],"award-info":[{"award-number":["1637473"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1637474"],"award-info":[{"award-number":["1637474"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2802"],"award-info":[{"award-number":["N00014-16-1-2802"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-018-1355-4","type":"journal-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T01:43:07Z","timestamp":1544146987000},"page":"237-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":85,"title":["Communication-efficient algorithms for decentralized and stochastic optimization"],"prefix":"10.1007","volume":"180","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[]},{"given":"Soomin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"1355_CR1","series-title":"Stanford Mathematical Studies in the Social Sciences","volume-title":"Studies in Linear and Non-linear Programming","author":"K Arrow","year":"1958","unstructured":"Arrow, K., Hurwicz, L., Uzawa, H.: Studies in Linear and Non-linear Programming. Stanford Mathematical Studies in the Social Sciences. Stanford University Press, Stanford (1958)"},{"key":"1355_CR2","unstructured":"Aybat, N.S., Hamedani, E.Y.: A primal-dual method for conic constrained distributed optimization problems. In: Advances in Neural Information Processing Systems, pp. 5049\u20135057 (2016)"},{"issue":"1","key":"1355_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TAC.2017.2713046","volume":"63","author":"NS Aybat","year":"2018","unstructured":"Aybat, N.S., Wang, Z., Lin, T., Ma, S.: Distributed linearized alternating direction method of multipliers for composite convex consensus optimization. IEEE Trans. Autom. Control 63(1), 5\u201320 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1355_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129, 163\u2013195 (2011)","journal-title":"Math. Program."},{"key":"1355_CR5","unstructured":"Bertsekas, D.P.: Incremental aggregated proximal and augmented lagrangian algorithms. Technical Report LIDS-P-3176, Laboratory for Information and Decision Systems (2015)"},{"issue":"1","key":"1355_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1355_CR7","unstructured":"Bradley, Paul S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: ICML, vol. 98, pp. 82\u201390 (1998)"},{"issue":"3","key":"1355_CR8","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1\u20132","key":"1355_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1355_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"1355_CR11","unstructured":"Chang, T., Hong, M.: Stochastic proximal gradient consensus over random networks. arxiv:1511.08905 (2015)"},{"key":"1355_CR12","unstructured":"Chang, T., Hong, M., Wang, X.: Multi-agent distributed optimization via inexact consensus admm. arxiv:1402.6065 (2014)"},{"key":"1355_CR13","doi-asserted-by":"crossref","unstructured":"Chen, A., Ozdaglar, A.: A fast distributed proximal gradient method. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 601\u2013608 (2012)","DOI":"10.1109\/Allerton.2012.6483273"},{"issue":"4","key":"1355_CR14","doi-asserted-by":"crossref","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"1355_CR15","unstructured":"Dang, C., Lan, G.: Randomized first-order methods for saddle point optimization. Technical Report 32611, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL (2015)"},{"key":"1355_CR16","unstructured":"Deng, Q., Lan, G., Rangarajan, A.: Randomized block subgradient methods for convex nonsmooth and stochastic optimization. arXiv preprint arXiv:1509.04609 (2015)"},{"issue":"3","key":"1355_CR17","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","volume":"57","author":"J Duchi","year":"2012","unstructured":"Duchi, J., Agarwal, A., Wainwright, M.: Dual averaging for distributed optimization: convergence analysis and network scaling. IEEE Trans. Autom. Control 57(3), 592\u2013606 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1355_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10514-011-9260-1","volume":"32","author":"JW Durham","year":"2012","unstructured":"Durham, J.W., Franchi, A., Bullo, F.: Distributed pursuit-evasion without mapping or global localization via local frontiers. Auton. Robots 32(1), 81\u201395 (2012)","journal-title":"Auton. Robots"},{"issue":"4","key":"1355_CR19","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: a generic algorithmic framework. SIAM J. Optim. 22(4), 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1355_CR20","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23(4), 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"key":"1355_CR21","unstructured":"Gurbuzbalaban, M., Ozdaglar, A., Parrilo, P.: On the convergence rate of incremental aggregated gradient algorithms. arxiv:1506.02081 (2015)"},{"issue":"2","key":"1355_CR22","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the o(1\/n) convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1355_CR23","first-page":"127","volume":"103","author":"N He","year":"2015","unstructured":"He, N., Juditsky, A., Nemirovski, A.: Mirror prox algorithm for multi-term composite minimization and semi-separable problems. J. Comput. Optim. Appl. 103, 127\u2013152 (2015)","journal-title":"J. Comput. Optim. Appl."},{"key":"1355_CR24","volume-title":"Topics in Matrix Analysis","author":"RA Hom","year":"1991","unstructured":"Hom, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge UP, New York (1991)"},{"issue":"6","key":"1355_CR25","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988\u20131001 (2003)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"1355_CR26","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1109\/TAC.2014.2298712","volume":"59","author":"D Jakovetic","year":"2014","unstructured":"Jakovetic, D., Xavier, J., Moura, J.: Fast distributed gradient methods. IEEE Trans. Autom. Control 59(5), 1131\u20131145 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1355_CR27","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1355_CR28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10107-015-0955-5","volume":"159","author":"G Lan","year":"2016","unstructured":"Lan, G.: Gradient sliding for composite optimization. Math. Program. 159(1), 201\u2013235 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"1355_CR29","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10107-011-0442-6","volume":"134","author":"G Lan","year":"2012","unstructured":"Lan, G., Nemirovski, A., Shapiro, A.: Validation analysis of mirror descent stochastic approximation method. Math. Program. 134(2), 425\u2013458 (2012)","journal-title":"Math. Program."},{"key":"1355_CR30","unstructured":"Lan, G., Zhou, Y.: An optimal randomized incremental gradient method. arxiv:1507.02000 (2015)"},{"key":"1355_CR31","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger, D.G., Ye, Y., et al.: Linear and Nonlinear Programming, vol. 2. Springer, Berlin (1984)"},{"key":"1355_CR32","unstructured":"Makhdoumi, A., Ozdaglar, A.: Convergence rate of distributed admm over networks. arxiv:1601.00194 (2016)"},{"key":"1355_CR33","doi-asserted-by":"crossref","unstructured":"Mokhtari, A., Shi, W., Ling, Q., Ribeiro, A.: Dqm: Decentralized quadratically approximated alternating direction method of multipliers. arxiv:1508.02073 (2015)","DOI":"10.1109\/GlobalSIP.2015.7418306"},{"key":"1355_CR34","doi-asserted-by":"crossref","unstructured":"Mokhtari, A., Shi, W., Ling, Q., Ribeiro, A.: A decentralized second-order method with exact linear convergence rate for consensus optimization. arxiv:1602.00596 (2016)","DOI":"10.1109\/ACSSC.2016.7869153"},{"issue":"6","key":"1355_CR35","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1355_CR36","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of Tseng\u2019s modified F-B splitting and korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21(4), 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1355_CR37","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"key":"1355_CR38","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal projection method for the iterates and the ergodic mean. SIAM J. Optim. 20, 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1355_CR39","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1109\/TAC.2010.2079650","volume":"56","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Asynchronous broadcast-based convex optimization over a network. IEEE Trans. Autom. Control 56(6), 1337\u20131351 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1355_CR40","first-page":"381","volume-title":"Studies in Computational Mathematics","author":"A. Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P., Borkar, V.S.: Distributed asynchronous incremental subgradient methods. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 311\u2013407 (2001)"},{"issue":"3","key":"1355_CR41","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","volume":"60","author":"A Nedi\u0107","year":"2015","unstructured":"Nedi\u0107, A., Olshevsky, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Autom. Control 60(3), 601\u2013615 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1355_CR42","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Olshevsky, A., Shi, W.: Achieving geometric convergence for distributed optimization over time-varying graphs. arxiv:1607.03218 (2016)","DOI":"10.1109\/CDC.2016.7798402"},{"issue":"1","key":"1355_CR43","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1355_CR44","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"AS Nemirovski","year":"2005","unstructured":"Nemirovski, A.S.: Prox-method with rate of convergence $$o(1\/t)$$ for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15, 229\u2013251 (2005)","journal-title":"SIAM J. Optim."},{"key":"1355_CR45","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"AS Nemirovski","year":"2009","unstructured":"Nemirovski, A.S., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1355_CR46","unstructured":"Nemirovski, A.S., Yudin, D.: Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics. Wiley, XV (1983)"},{"issue":"2","key":"1355_CR47","first-page":"275","volume":"61","author":"YE Nesterov","year":"2015","unstructured":"Nesterov, Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 61(2), 275\u2013319 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1355_CR48","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao Jr., E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"1355_CR49","doi-asserted-by":"crossref","unstructured":"Qu, G., Li, N.: Harnessing smoothness to accelerate distributed optimization. arxiv:1605.07112 (2016)","DOI":"10.1109\/CDC.2016.7798263"},{"key":"1355_CR50","doi-asserted-by":"crossref","unstructured":"Rabbat, M.: Multi-agent mirror descent for decentralized stochastic optimization. In: 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pp. 517\u2013520 (2015)","DOI":"10.1109\/CAMSAP.2015.7383850"},{"key":"1355_CR51","doi-asserted-by":"crossref","unstructured":"Rabbat, M., Nowak, R.D.: Distributed optimization in sensor networks. In: IPSN, pp. 20\u201327 (2004)","DOI":"10.1145\/984622.984626"},{"issue":"2","key":"1355_CR52","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/080726380","volume":"20","author":"SS Ram","year":"2009","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Incremental stochastic subgradient algorithms for convex optimization. SIAM J. Optim. 20(2), 691\u2013717 (2009)","journal-title":"SIAM J. Optim."},{"key":"1355_CR53","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","volume":"147","author":"SS Ram","year":"2010","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Distributed stochastic subgradient projection algorithms for convex optimization. J. Optim. Theory Appl. 147, 516\u2013545 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1355_CR54","doi-asserted-by":"crossref","unstructured":"Ram, S.S., Veeravalli, V.V., Nedi\u0107, A.: Distributed non-autonomous power control through distributed convex optimization. In: IEEE INFOCOM, pp. 3001\u20133005 (2009)","DOI":"10.1109\/INFCOM.2009.5062275"},{"issue":"7","key":"1355_CR55","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/TSP.2014.2304432","volume":"62","author":"W Shi","year":"2014","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: On the linear convergence of the ADMM in decentralized consensus optimization. IEEE Trans. Sig. Process. 62(7), 1750\u20131761 (2014)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"2","key":"1355_CR56","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1137\/14096668X","volume":"25","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: Extra: an exact first-order algorithm for decentralized consensus optimization. SIAM J. Optim. 25(2), 944\u2013966 (2015)","journal-title":"SIAM J. Optim."},{"issue":"22","key":"1355_CR57","doi-asserted-by":"crossref","first-page":"6013","DOI":"10.1109\/TSP.2015.2461520","volume":"63","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: A proximal gradient algorithm for decentralized composite optimization. IEEE Trans. Sig. Process. 63(22), 6013\u20136023 (2015)","journal-title":"IEEE Trans. Sig. Process."},{"key":"1355_CR58","unstructured":"Simonetto, A., Kester, L., Leus, G.: Distributed time-varying stochastic optimization and utility-based communication. arxiv:1408.5294 (2014)"},{"issue":"1","key":"1355_CR59","doi-asserted-by":"crossref","first-page":"11245","DOI":"10.3182\/20110828-6-IT-1002.01959","volume":"44","author":"H Terelius","year":"2011","unstructured":"Terelius, H., Topcu, U., Murray, R.: Decentralized multi-agent optimization via dual decomposition. IFAC Proc. Vol. 44(1), 11245\u201311251 (2011)","journal-title":"IFAC Proc. Vol."},{"key":"1355_CR60","doi-asserted-by":"crossref","unstructured":"Tsianos, K., Lawlor, S., Rabbat, M.: Consensus-based distributed optimization: practical issues and applications in large-scale machine learning. In: Proceedings of the 50th Allerton Conference on Communication, Control, and Computing (2012)","DOI":"10.1109\/Allerton.2012.6483403"},{"key":"1355_CR61","doi-asserted-by":"crossref","unstructured":"Tsianos, K., Rabbat, M.: Consensus-based distributed online prediction and optimization. In: 2013 IEEE Global Conference on Signal and Information Processing, pp. 807\u2013810 (2013)","DOI":"10.1109\/GlobalSIP.2013.6737014"},{"issue":"9","key":"1355_CR62","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"J Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, J., Bertsekas, D., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31(9), 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1355_CR63","unstructured":"Tsitsiklis, J.N.: Problems in Decentralized Decision Making and Computation. Ph.D. thesis, Massachusetts Inst. Technol., Cambridge, MA (1984)"},{"key":"1355_CR64","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection-proximal methods for nonsmooth convex optimization. Technical Report LIDS-P-2907, Laboratory for Information and Decision Systems (2013)"},{"key":"1355_CR65","doi-asserted-by":"crossref","unstructured":"Wei, E., Ozdaglar, A.: On the $${O}(1\/k)$$ convergence of asynchronous distributed alternating direction method of multipliers. arxiv:1307.8254 (2013)","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"1355_CR66","unstructured":"Xi, C., Wu, Q., Khan, U.A.: Distributed mirror descent over directed graphs. arxiv:1412.5526 (2014)"},{"key":"1355_CR67","unstructured":"Zhu, J., Rosset, S., Tibshirani, R., Hastie, T.J.: 1-norm support vector machines. In: Advances in neural information processing systems, pp. 49\u201356 (2004)"},{"issue":"1","key":"1355_CR68","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","volume":"57","author":"M Zhu","year":"2012","unstructured":"Zhu, M., Martinez, S.: On distributed convex optimization under inequality and equality constraints. IEEE Trans. Autom. Control 57(1), 151\u2013164 (2012)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1355-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T20:32:03Z","timestamp":1662582723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1355-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,7]]},"references-count":68,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1355"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1355-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,7]]},"assertion":[{"value":"16 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}