文章基本信息

标题：Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs * * This work was supported by the National Natural Science Foundation of China (61304038, 41576101), and Tsinghua University Initiative Scientific Research Program.
本地全文：下载
作者：Pei Xie ; Keyou You ; Shiji Song 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2017
卷号：50
期号：1
页码：14436-14441
DOI：10.1016/j.ifacol.2017.08.2284
语种：English
出版社：Elsevier
摘要：AbstractThis paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To collaboratively solve the optimization, most of the existing works require the interaction graph to be balanced or “doubly-stochastic”, which is quite restrictive and not necessary as shown in this paper. We focus on an epigraph form of the original optimization to resolve the “unbalanced” problem, and design a novel two-step recursive algorithm with a simple structure. Under strongly connected digraphs, we prove that each node asymptotically converges to some common optimal solution. Finally, simulations are performed to illustrate the effectiveness of the proposed algorithms.
关键词：KeywordsDistributed algorithmsconstrained optimizationunbalanced digraphsepigraph formrandom-fixed projected algorithm