{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:03:41Z","timestamp":1766268221770},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11432-020-3275-3","type":"journal-article","created":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T10:04:06Z","timestamp":1664791446000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Distributed quantized mirror descent for strongly convex optimization over time-varying directed graph"],"prefix":"10.1007","volume":"65","author":[{"given":"Menghui","family":"Xiong","sequence":"first","affiliation":[]},{"given":"Baoyong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Deming","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Shengyuan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"3275_CR1","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1109\/TSP.2010.2045416","volume":"58","author":"Q Shi","year":"2010","unstructured":"Shi Q, He C, Chen H, et al. Distributed wireless sensor network localization via sequential greedy optimization algorithm. IEEE Trans Signal Process, 2010, 58: 3328\u20133340","journal-title":"IEEE Trans Signal Process"},{"key":"3275_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/JAS.2015.7152660","volume":"2","author":"Z Liu","year":"2015","unstructured":"Liu Z, Yuan Y, Guan X, et al. An approach of distributed joint optimization for cluster-based wireless sensor networks. IEEE\/CAA J Autom Sin, 2015, 2: 267\u2013273","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"3275_CR3","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/TSG.2017.2720471","volume":"8","author":"D K Molzahn","year":"2017","unstructured":"Molzahn D K, Dorfler F, Sandberg H, et al. A survey of distributed optimization and control algorithms for electric power systems. IEEE Trans Smart Grid, 2017, 8: 2941\u20132962","journal-title":"IEEE Trans Smart Grid"},{"key":"3275_CR4","doi-asserted-by":"publisher","first-page":"3898","DOI":"10.1109\/TAC.2016.2525808","volume":"61","author":"P Braun","year":"2016","unstructured":"Braun P, Grune L, Kellett C M, et al. A distributed optimization algorithm for the predictive control of smart grids. IEEE Trans Automat Contr, 2016, 61: 3898\u20133911","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR5","doi-asserted-by":"publisher","first-page":"012204","DOI":"10.1007\/s11432-016-9114-y","volume":"61","author":"W W Yu","year":"2018","unstructured":"Yu W W, Li C J, Yu X H, et al. Economic power dispatch in smart grids: a framework for distributed optimization and consensus dynamics. Sci China Inf Sci, 2018, 61: 012204","journal-title":"Sci China Inf Sci"},{"key":"3275_CR6","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1109\/JPROC.2020.3007634","volume":"108","author":"H Li","year":"2020","unstructured":"Li H, Fang C, Lin Z. Accelerated first-order optimization algorithms for machine learning. Proc IEEE, 2020, 108: 2067\u20132082","journal-title":"Proc IEEE"},{"key":"3275_CR7","doi-asserted-by":"crossref","unstructured":"Hu W, Wu A. Accelerated distributed algorithm for solving linear algebraic equations. In: Proceedings of 2020 Chinese Intelligent Systems Conference, 2021. 705: 389\u2013398","DOI":"10.1007\/978-981-15-8450-3_42"},{"key":"3275_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.automatica.2018.07.021","volume":"97","author":"A G Wu","year":"2018","unstructured":"Wu A G, Sun H J, Zhang Y. An SOR implicit iterative algorithm for coupled Lyapunov equations. Automatica, 2018, 97: 38\u201347","journal-title":"Automatica"},{"key":"3275_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.arcontrol.2019.05.006","volume":"47","author":"T Yang","year":"2019","unstructured":"Yang T, Yi X, Wu J, et al. A survey of distributed optimization. Annu Rev Control, 2019, 47: 278\u2013305","journal-title":"Annu Rev Control"},{"key":"3275_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/MSP.2020.2975210","volume":"37","author":"A Nedic","year":"2020","unstructured":"Nedic A. Distributed gradient methods for convex machine learning problems in networks: distributed optimization. IEEE Signal Process Mag, 2020, 37: 92\u2013101","journal-title":"IEEE Signal Process Mag"},{"key":"3275_CR11","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1360\/SST-2020-0040","volume":"50","author":"T Yang","year":"2020","unstructured":"Yang T, Chai T Y. Research status and prospects of distributed collaborative optimization. Sci Sin Tech, 2020, 50: 1414\u20131425","journal-title":"Sci Sin Tech"},{"key":"3275_CR12","doi-asserted-by":"publisher","first-page":"199203","DOI":"10.1007\/s11432-018-9731-1","volume":"63","author":"P Lin","year":"2020","unstructured":"Lin P, Qi H S. Distributed gradient-based sampling algorithm for least-squares in switching multi-agent networks. Sci China Inf Sci, 2020, 63: 199203","journal-title":"Sci China Inf Sci"},{"key":"3275_CR13","doi-asserted-by":"publisher","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. Operations Res Lett, 2003, 31: 167\u2013175","journal-title":"Operations Res Lett"},{"key":"3275_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/120894464","volume":"24","author":"A Nedic","year":"2014","unstructured":"Nedic A, Lee S. On stochastic subgradient mirror-descent algorithm with weighted averaging. SIAM J Optim, 2014, 24: 84\u2013107","journal-title":"SIAM J Optim"},{"key":"3275_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.automatica.2017.12.053","volume":"90","author":"D Yuan","year":"2018","unstructured":"Yuan D, Hong Y, Ho D W C, et al. Optimal distributed stochastic mirror descent for strongly convex optimization. Automatica, 2018, 90: 196\u2013203","journal-title":"Automatica"},{"key":"3275_CR16","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s11590-016-1071-z","volume":"12","author":"J Li","year":"2018","unstructured":"Li J, Li G, Wu Z, et al. Stochastic mirror descent method for distributed multi-agent optimization. Optim Lett, 2018, 12: 1179\u20131197","journal-title":"Optim Lett"},{"key":"3275_CR17","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2017.2743462","volume":"63","author":"S Shahrampour","year":"2018","unstructured":"Shahrampour S, Jadbabaie A. Distributed online optimization in dynamic environments using mirror descent. IEEE Trans Automat Contr, 2018, 63: 714\u2013725","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.acha.2018.05.005","volume":"48","author":"Y Lei","year":"2020","unstructured":"Lei Y, Zhou D X. Convergence of online mirror descent. Appl Comput Harmonic Anal, 2020, 48: 343\u2013373","journal-title":"Appl Comput Harmonic Anal"},{"key":"3275_CR19","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2020.2987379","volume":"66","author":"D Yuan","year":"2021","unstructured":"Yuan D, Hong Y, Ho D W C, et al. Distributed mirror descent for online composite optimization. IEEE Trans Automat Contr, 2021, 66: 714\u2013729","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR20","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TSP.2020.2964200","volume":"68","author":"X Yi","year":"2020","unstructured":"Yi X, Li X, Xie L, et al. Distributed online convex optimization with time-varying coupled inequality constraints. IEEE Trans Signal Process, 2020, 68: 731\u2013746","journal-title":"IEEE Trans Signal Process"},{"key":"3275_CR21","doi-asserted-by":"publisher","first-page":"3936","DOI":"10.1109\/TAC.2016.2529285","volume":"61","author":"A Nedic","year":"2016","unstructured":"Nedic A, Olshevsky A. Stochastic gradient-push for strongly convex functions on time-varying directed graphs. IEEE Trans Automat Contr, 2016, 61: 3936\u20133947","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR22","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TNSE.2017.2713396","volume":"4","author":"M O Sayin","year":"2017","unstructured":"Sayin M O, Vanli N D, Kozat S S, et al. Stochastic subgradient algorithms for strongly convex optimization over distributed networks. IEEE Trans Netw Sci Eng, 2017, 4: 248\u2013260","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"3275_CR23","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1109\/TIE.2016.2617832","volume":"64","author":"T Yang","year":"2017","unstructured":"Yang T, Lu J, Wu D, et al. A distributed algorithm for economic dispatch over time-varying directed networks with delays. IEEE Trans Ind Electron, 2017, 64: 5095\u20135106","journal-title":"IEEE Trans Ind Electron"},{"key":"3275_CR24","doi-asserted-by":"publisher","first-page":"2344","DOI":"10.1109\/TNNLS.2020.3004723","volume":"32","author":"D Yuan","year":"2021","unstructured":"Yuan D, Ho D W C, Xu S. Stochastic strongly convex optimization via distributed epoch stochastic gradient algorithm. IEEE Trans Neural Netw Learn Syst, 2021, 32: 2344\u20132357","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3275_CR25","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1016\/j.sysconle.2012.06.004","volume":"61","author":"D Yuan","year":"2012","unstructured":"Yuan D, Xu S, Zhao H, et al. Distributed dual averaging method for multi-agent optimization with quantized communication. Syst Control Lett, 2012, 61: 1053\u20131061","journal-title":"Syst Control Lett"},{"key":"3275_CR26","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TCNS.2014.2357513","volume":"1","author":"P Yi","year":"2014","unstructured":"Yi P, Hong Y. Quantized subgradient algorithm and data-rate analysis for distributed optimization. IEEE Trans Control Netw Syst, 2014, 1: 380\u2013392","journal-title":"IEEE Trans Control Netw Syst"},{"key":"3275_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.neucom.2015.12.043","volume":"185","author":"C Huang","year":"2016","unstructured":"Huang C, Li H, Xia D, et al. Quantized subgradient algorithm with limited bandwidth communications for solving distributed optimization over general directed multi-agent networks. Neurocomputing, 2016, 185: 153\u2013162","journal-title":"Neurocomputing"},{"key":"3275_CR28","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1002\/mma.4044","volume":"40","author":"J Li","year":"2017","unstructured":"Li J, Chen G, Wu Z, et al. Distributed subgradient method for multi-agent optimization with quantized communication. Math Meth Appl Sci, 2017, 40: 1201\u20131213","journal-title":"Math Meth Appl Sci"},{"key":"3275_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/JAS.2014.7004550","volume":"1","author":"W Liu","year":"2014","unstructured":"Liu W, Deng F, Liang J, et al. Distributed average consensus in multi-agent networks with limited bandwidth and time-delays. IEEE\/CAA J Autom Sin, 2014, 1: 193\u2013203","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"3275_CR30","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1109\/TCYB.2017.2681119","volume":"47","author":"H Li","year":"2017","unstructured":"Li H, Huang C, Chen G, et al. Distributed consensus optimization in multiagent networks with time-varying directed topologies and quantized communication. IEEE Trans Cybern, 2017, 47: 2044\u20132057","journal-title":"IEEE Trans Cybern"},{"key":"3275_CR31","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.1109\/TAC.2016.2600597","volume":"62","author":"Y Pu","year":"2017","unstructured":"Pu Y, Zeilinger M N, Jones C N. Quantization design for distributed optimization. IEEE Trans Automat Contr, 2017, 62: 2107\u20132120","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR32","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","volume":"147","author":"S S Ram","year":"2010","unstructured":"Ram S S, Nedi\u0107 A, Veeravalli V V. Distributed stochastic subgradient projection algorithms for convex optimization. J Optim Theor Appl, 2010, 147: 516\u2013545","journal-title":"J Optim Theor Appl"},{"key":"3275_CR33","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedic","year":"2009","unstructured":"Nedic A, Ozdaglar A. Distributed subgradient methods for multi-agent optimization. IEEE Trans Automat Contr, 2009, 54: 48\u201361","journal-title":"IEEE Trans Automat Contr"},{"key":"3275_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck A. First-Order Methods in Optimization. Philadelphia: SIAM, 2017"},{"key":"3275_CR35","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L M 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, 1967, 7: 200\u2013217","journal-title":"USSR Comput Math Math Phys"},{"key":"3275_CR36","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen G, Teboulle M. Convergence analysis of a proximal-like minimization algorithm using bregman functions. SIAM J Optim, 1993, 3: 538\u2013543","journal-title":"SIAM J Optim"},{"key":"3275_CR37","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/TAC.2020.2989282","volume":"66","author":"X Li","year":"2021","unstructured":"Li X, Feng G, Xie L. Distributed proximal algorithms for multiagent optimization with coupled inequality constraints. IEEE Trans Automat Contr, 2021, 66: 1223\u20131230","journal-title":"IEEE Trans Automat Contr"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3275-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3275-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3275-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T22:05:51Z","timestamp":1699135551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3275-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":37,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3275"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3275-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,26]]},"assertion":[{"value":"2 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"202202"}}