论文摘要
Distributed optimization is of essential importance in networked systems. Most of the literature either assume the information exchange over undirected graphs, or require that the underlying directed network topology provides balanced weights to the agents. In this paper, a novel distributed algorithm is proposed to solve convex optimization problems over unbalanced graphs. The algorithm is based on in-degrees and out-degrees of the graph, but uses less variables than the push-DIGing algorithm. Also, our algorithm reduces to the surplus-based algorithm for average consensus problems and is equivalent to the DIGing algorithm when the graph is undirected. As a result, our algorithm can be regarded as an integration of the surplus-based method and push-DIGing method. The effectiveness of the proposed algorithm is illustrated by a numerical example, while the convergence analysis is currently in processing.
论文目录
文章来源
类型: 国际会议
作者: Shu Liang,Songsong Cheng,Kaixiang Peng
来源: 第三十八届中国控制会议 2019-07-27
年度: 2019
分类: 基础科学
专业: 数学,数学
单位: Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education, School of Automation and Electrical Engineering, University of Science and Technology BeijingAcademy of Mathematics and Systems Science, Chinese Academy of Sciences
分类号: O224;O157.5
页码: 512-517
总页数: 6
文件大小: 539k
下载量: 2