期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 63, 期 12, 页码 4331-4337出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2018.2816104
关键词
Constrained optimization; distributed algorithms; epigraph form; random-fixed projected algorithm; time-varying unbalanced digraphs
资金
- National Natural Science Foundation of China [61722308, 41576101]
- Tsinghua University Initiative Scientific Research Program
This paper considers a distributed convex optimization problem with inequality constraints over time-varying unbalanced digraphs, where the cost function is a sum of local objective functions, and each node of the graph only knows its local objective and inequality constraints. Although there is a vast body of literature on distributed optimization. most of them require the graph to be balanced, which is quite restrictive and not necessary. To solve it, this work proposes a novel idea of using the epigraph form of the constrained optimization. which can be easily used to study time-varying unbalanced digraphs. Under local communications, a simple iterative algorithm is then designed for each node. We prove that if the graph is uniformly jointly strongly connected, each node asymptotically converges to some common optimal solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据