{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T00:34:31Z","timestamp":1768091671614,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11424-022-0187-8","type":"journal-article","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T12:17:04Z","timestamp":1659701824000},"page":"1244-1261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Distributed Communication-Sliding Mirror-Descent Algorithm for Nonsmooth Resource Allocation Problem"],"prefix":"10.1007","volume":"35","author":[{"given":"Yinghui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zhipeng","family":"Tu","sequence":"additional","affiliation":[]},{"given":"Huashu","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,5]]},"reference":[{"key":"187_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.automatica.2016.08.007","volume":"74","author":"P Yi","year":"2016","unstructured":"Yi P, Hong Y, and Liu F, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems, Automatica, 2016, 74: 259\u2013269.","journal-title":"Automatica"},{"issue":"1","key":"187_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s11424-018-7145-5","volume":"31","author":"X Zeng","year":"2018","unstructured":"Zeng X, Yi P, and Hong Y, Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters, Journal of Systems Science & Complexity, 2018, 31(1): 103\u2013119.","journal-title":"Journal of Systems Science & Complexity"},{"key":"187_CR3","doi-asserted-by":"crossref","unstructured":"Nedi A, Olshevsky A, and Shi W, Improved convergence rates for distributed resource allocation, 2018 IEEE Conference on Decision and Control (CDC), IEEE, 2018, 172\u2013177.","DOI":"10.1109\/CDC.2018.8619322"},{"issue":"4","key":"187_CR4","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11768-020-00018-8","volume":"18","author":"Y Wang","year":"2020","unstructured":"Wang Y, Tu Z, and Qin H, Distributed stochastic mirror descent algorithm for resource allocation problem, Control Theory and Technology, 2020, 18(4): 339\u2013347.","journal-title":"Control Theory and Technology"},{"issue":"1","key":"187_CR5","first-page":"151","volume":"57","author":"M Zhu","year":"2011","unstructured":"Zhu M and Martnez S, On distributed convex optimization under inequality and equality constraints, IEEE Transactions on Automatic Control, 2011, 57(1): 151\u2013164.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"187_CR6","doi-asserted-by":"publisher","first-page":"2186","DOI":"10.1109\/TSP.2020.2981762","volume":"68","author":"J Zhang","year":"2020","unstructured":"Zhang J, You K, and Cai K, Distributed dual gradient tracking for resource allocation in unbalanced networks, IEEE Transactions on Signal Processing, 2020, 68: 2186\u20132198.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"187_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TCNS.2018.2834310","volume":"6","author":"J Xu","year":"2018","unstructured":"Xu J, Zhu S, Soh Y C, et al., A dual splitting approach for distributed resource allocation with regularization, IEEE Transactions on Control of Network Systems, 2018, 6(1): 403\u2013414.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"1","key":"187_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TNN.2003.809398","volume":"15","author":"V Roth","year":"2004","unstructured":"Roth V, The generalized LASSO, IEEE Transactions on Neural Networks, 2004, 15(1): 16\u201328.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"7","key":"187_CR9","doi-asserted-by":"publisher","first-page":"3208","DOI":"10.1109\/TCYB.2019.2901256","volume":"50","author":"Z Deng","year":"2019","unstructured":"Deng Z, Nian X, and Hu C, Distributed algorithm design for nonsmooth resource allocation problems, IEEE transactions on cybernetics, 2019, 50(7): 3208\u20133217.","journal-title":"IEEE transactions on cybernetics"},{"key":"187_CR10","doi-asserted-by":"publisher","unstructured":"Zhu Y, Wen G, Yu W, et al., Continuous-time distributed proximal gradient algorithms for nonsmooth resource allocation over general digraphs, IEEE Transactions on Network Science and Engineering, 2021, DOI: https:\/\/doi.org\/10.1109\/TNSE.2021.3070398.","DOI":"10.1109\/TNSE.2021.3070398"},{"key":"187_CR11","doi-asserted-by":"publisher","first-page":"110071","DOI":"10.1016\/j.automatica.2021.110071","volume":"136","author":"Y Wei","year":"2022","unstructured":"Wei Y, Shang C, Fang H, et al. Solving a class of nonsmooth resource allocation problems with directed graphs though distributed smooth multi-proximal algorithms, Automatica, 2022, 136: 110071.","journal-title":"Automatica"},{"issue":"4","key":"187_CR12","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TCNS.2018.2889011","volume":"6","author":"H Iiduka","year":"2018","unstructured":"Iiduka H, Distributed optimization for network resource allocation with nonsmooth utility functions, IEEE Transactions on Control of Network Systems, 2018, 6(4): 1354\u20131365.","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"3","key":"187_CR13","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1016\/j.ejor.2017.09.043","volume":"270","author":"Y Nesterov","year":"2018","unstructured":"Nesterov Y and Shikhman V, Dual subgradient method with averaging for optimal resource allocation, European Journal of Operational Research, 2018, 270(3): 907\u2013916.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"187_CR14","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 Computational Mathematics and Mathematical Physics, 1967, 7(3): 200\u2013217.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"187_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"},{"issue":"1","key":"187_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1355-4","volume":"180","author":"G Lan","year":"2020","unstructured":"Lan G, Lee S, and Zhou Y, Communication-efficient algorithms for decentralized and stochastic optimization, Mathematical Programming, 2020, 180(1): 237\u2013284.","journal-title":"Mathematical Programming"},{"issue":"1","key":"187_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang Y, Chen Y, Lan G, et al., An accelerated linearized alternating direction method of multipliers, SIAM Journal on Imaging Sciences, 2015, 8(1): 644\u2013681.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"187_CR18","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi S and Lan G, Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework, SIAM Journal on Optimization, 2012, 22(4): 1469\u20131492.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-022-0187-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T10:47:07Z","timestamp":1660560427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-022-0187-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["187"],"URL":"https:\/\/doi.org\/10.1007\/s11424-022-0187-8","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]},"assertion":[{"value":"9 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}