Distributed Communication-Sliding Mirror-Descent Algorithm for Nonsmooth Resource Allocation Problem  

作　　者：WANG Yinghui TU Zhipeng QIN Huashu 

机构地区：[1]School of Automation and Electrical Engineering,University of Science and Technology Beijing,Beijing,100083,China [2]Key Lab of Systems and Control,Academy of Mathematics and Systems Science,Beijing,100190,China [3]University of Chinese Academy of Sciences,Beijing,100190,China

出　　处：《Journal of Systems Science & Complexity》2022年第4期1244-1261,共18页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.72101026,61621063;the State Key Laboratory of Intelligent Control and Decision of Complex Systems。

摘　　要：This paper considers a distributed nonsmooth resource allocation problem of minimizing a global convex function formed by a sum of local nonsmooth convex functions with coupled constraints.A distributed communication-efficient mirror-descent algorithm,which can reduce communication rounds between agents over the network,is designed for the distributed resource allocation problem.By employing communication-sliding methods,agents can find aε-solution in O(1/ε)communication rounds while maintaining O(1/ε^(2))subgradient evaluations for nonsmooth convex functions.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.

关 键 词：Distributed resource allocation problem mirror-descent algorithm nonsmooth functions 

分 类 号：O224[理学—运筹学与控制论]