{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:25:59Z","timestamp":1769858759605,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501070"],"award-info":[{"award-number":["11501070"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s11590-016-1071-z","type":"journal-article","created":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T02:16:26Z","timestamp":1472177786000},"page":"1179-1197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Stochastic mirror descent method for distributed multi-agent optimization"],"prefix":"10.1007","volume":"12","author":[{"given":"Jueyou","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoquan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyou","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changzhi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"key":"1071_CR1","unstructured":"Tsitsiklis, J.N.: Problems in decentralized decision making and computation, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1984)"},{"key":"1071_CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"JN Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, J.N., Bertsekas, D.P., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31, 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1071_CR3","volume-title":"Parallel and distributed computation: numerical methods","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and distributed computation: numerical methods. Athena Scientific, Belmont (1997)"},{"key":"1071_CR4","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1109\/TAC.2004.834113","volume":"49","author":"R Olfati-Saber","year":"2004","unstructured":"Olfati-Saber, R., Murray, R.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Autom. Control 49, 1520\u20131533 (2004)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1071_CR5","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1137\/08073038X","volume":"20","author":"B Johansson","year":"2009","unstructured":"Johansson, B., Rabi, M., Johansson, M.: A randomized incremental subgradient method for distributed optimization in networked systems. SIAM J. Optim. 20, 1157\u20131170 (2009)","journal-title":"SIAM J. Optim."},{"key":"1071_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\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1071_CR7","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, 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control."},{"key":"1071_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jpdc.2006.08.010","volume":"67","author":"L Xiao","year":"2007","unstructured":"Xiao, L., Boyd, S., Kim, S.J.: Distributed average consensus with least-mean-square deviation. J. Parallel Distrib. Comput. 67, 33\u201346 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1071_CR9","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1071_CR10","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","volume":"55","author":"A Nedi\u0107","year":"2010","unstructured":"Nedi\u0107, A., Ozdaglar, A., Parrilo, P.A.: Constrained consensus and optimization in multi-agent networks. IEEE Trans. Autom. Control. 55, 922\u2013938 (2010)","journal-title":"IEEE Trans. Autom. Control."},{"key":"1071_CR11","first-page":"516","volume":"147","author":"SS Ram","year":"2011","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 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"1071_CR12","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/TAC.2010.2091295","volume":"56","author":"I Lobel","year":"2011","unstructured":"Lobel, I., Ozdaglar, A.: Distributed subgradient methods for convex optimization over random networks. IEEE Trans. Autom. Control 56, 1291\u20131306 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1071_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/JSTSP.2013.2247023","volume":"7","author":"S Lee","year":"2013","unstructured":"Lee, S., Nedi\u0107, A.: Distributed random projection algorithm for convex optimization, IEEE. J. Select. Top. Signal Proc. 7, 221\u2013229 (2013)","journal-title":"J. Select. Top. Signal Proc."},{"key":"1071_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10898-014-0174-2","volume":"61","author":"J Li","year":"2015","unstructured":"Li, J., Wu, C., Wu, Z., Qiang, L.: Gradient-free method for nonsmooth distributed optimization. J. Global Optim. 61, 325\u2013340 (2015)","journal-title":"J. Global Optim."},{"key":"1071_CR15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1017\/S1446181114000273","volume":"56","author":"J Li","year":"2014","unstructured":"Li, J., Wu, C., Wu, Z., Qiang, L., Wang, X.: Distributed proximal-gradient method for convex optimization with inequality constraints. ANZIAM J. 56, 160\u2013178 (2014)","journal-title":"ANZIAM J."},{"key":"1071_CR16","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","volume":"57","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Agarwal, A., Wainwright, M.: Dual averaging for distributed optimization: Convergence analysis and network scaling. IEEE Trans. Autom. Control. 57, 592\u2013606 (2012)","journal-title":"IEEE Trans. Autom. Control."},{"key":"1071_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","volume":"57","author":"M Zhu","year":"2012","unstructured":"Zhu, M., Mart\u00ednez, S.: On distributed convex optimization under inequality and equality constraints. IEEE Trans. Autom. Control 57, 151\u2013164 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1071_CR18","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1109\/TSMCB.2011.2160394","volume":"41","author":"D Yuan","year":"2011","unstructured":"Yuan, D., Xu, S., Zhao, H.: Distributed primal-dual subgradient method for multiagent optimization via consensus algorithms. IEEE Trans. Syst. Man. Cybern. B 41, 1715\u20131724 (2011)","journal-title":"IEEE Trans. Syst. Man. Cybern. B"},{"key":"1071_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"1071_CR20","unstructured":"Xi, C.G., Wu, Q., Khan, U.A.: Distributed mirror descent over directed graphs, (2014); arXiv preprint arXiv:1412.5526"},{"key":"1071_CR21","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovksi","year":"1983","unstructured":"Nemirovksi, A., Yudin, D.: Problem complexity and method efficiency in optimization. John Wiley Press, New Jersey (1983)"},{"key":"1071_CR22","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., 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":"1071_CR23","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10107-008-0262-5","volume":"125","author":"A Nedi\u0107","year":"2010","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: The effect of deterministic noise in subgradient methods. Math. Progr. 125, 75\u201399 (2010)","journal-title":"Math. Progr."},{"key":"1071_CR24","volume-title":"Stochastic programming methods","author":"Y Ermoliev","year":"1976","unstructured":"Ermoliev, Y.: Stochastic programming methods. Nauka, Moscow (1976)"},{"key":"1071_CR25","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, 691\u2013717 (2009)","journal-title":"SIAM J. Optim."},{"key":"1071_CR26","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, U.S.S.R. Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"Comput. Math. Math. Phys."},{"key":"1071_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S1570-579X(01)80004-5","volume":"8","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Jonathan, M.B., Borwein, M.: Joint and separate convexity of the Bregman distance. Stud. Comput. Math. 8, 23\u201336 (2001)","journal-title":"Stud. Comput. Math."},{"key":"1071_CR28","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/120894464","volume":"24","author":"A Nedi\u0107","year":"2014","unstructured":"Nedi\u0107, A., Lee, S.: On stochastic subgradient mirror-descent algorithm with weighted averaging. SIAM J. Optim. 24, 84\u2013107 (2014)","journal-title":"SIAM J. Optim."},{"key":"1071_CR29","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.neucom.2015.12.017","volume":"177","author":"J Li","year":"2016","unstructured":"Li, J., Chen, G., Dong, Z., Wu, Z.: Distributed mirror descent method for multi-agent optimization with delay. Neurocomputing 177, 643\u2013650 (2016)","journal-title":"Neurocomputing"},{"key":"1071_CR30","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1002\/rnc.2856","volume":"23","author":"D Yuan","year":"2013","unstructured":"Yuan, D., Xu, S., Zhang, B., Rong, L.: Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints. Int. J. Robust. Nonlinear Control 23, 1846\u20131868 (2013)","journal-title":"Int. J. Robust. Nonlinear Control"},{"key":"1071_CR31","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1109\/TNNLS.2014.2336806","volume":"26","author":"D Yuan","year":"2015","unstructured":"Yuan, D., Ho, D.W.: Randomized gradient-free method for multiagent optimization over time-varying networks. IEEE Trans. Neural Networks Learn. Syst. 26, 1342\u20131347 (2015)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"issue":"2","key":"1071_CR32","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TAC.2012.2209984","volume":"58","author":"P Bianchi","year":"2013","unstructured":"Bianchi, P., Jakubowicz, J.: Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization. IEEE Trans. Autom. Control 58(2), 391\u2013405 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1071_CR33","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.automatica.2011.09.043","volume":"48","author":"F Yousefian","year":"2012","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On stochastic gradient and subgradient methods with adaptive steplength sequences. Automatica 48, 56\u201367 (2012)","journal-title":"Automatica"},{"key":"1071_CR34","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22, 674\u2013701 (2012)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1071-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1071-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T02:14:33Z","timestamp":1718763273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1071-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,26]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1071-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,26]]}}}