典型文献
Distributed Communication-Sliding Mirror-Descent Algorithm for Nonsmooth Resource Allocation Problem
文献摘要：
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 con-straints.A distributed communication-efficient mirror-descent algorithm,which can reduce commu-nication 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/ε)commu-nication 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.
文献关键词：
中图分类号：
作者姓名：
WANG Yinghui;TU Zhipeng;QIN Huashu
作者机构：
School of Automation and Electrical Engineering,University of Science and Technology Beijing,Beijing 100083,China;Key Lab of Systems and Control,Academy of Mathematics and Systems Science,Beijing 100190,China;Uni-versity of Chinese Academy of Sciences,Beijing 100190,China
文献出处：
引用格式：
[1]WANG Yinghui;TU Zhipeng;QIN Huashu-.Distributed Communication-Sliding Mirror-Descent Algorithm for Nonsmooth Resource Allocation Problem)[J].系统科学与复杂性学报（英文版）,2022(04):1244-1261
A类：
B类：
Distributed,Communication,Sliding,Mirror,Descent,Algorithm,Nonsmooth,Resource,Allocation,Problem,This,paper,considers,distributed,nonsmooth,resource,allocation,problem,minimizing,global,convex,formed,by,sum,local,functions,coupled,straints,communication,efficient,mirror,descent,algorithm,which,can,reduce,rounds,between,agents,over,network,designed,By,employing,sliding,methods,find,solution,while,maintaining,subgradient,evaluations,numerical,example,also,given,illustrate,effectiveness,proposed
AB值：
0.664212
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
