Linearly Convergent Decentralized Consensus Optimization Over Directed Networks
2016 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP)(2016)
摘要
Recently, there have been growing interests in solving distributed consensus optimization problems over directed networks that consist of multiple agents. In this paper, we develop a first-order (gradient-based) algorithm, referred to as Push-DIGing, for this class of problems. To run Push-DIGing, each agent in the network only needs to know its own out-degree and employs a fixed step-size. Under the strong convexity assumption, we prove that the introduced algorithm converges to the global minimizer at some R-linear (geometric) rate as long as the nonnegative step-size is no greater than some explicit bound.
更多查看译文
关键词
Distributed optimization, directed network, linear convergence, small-gain theorem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要