论文标题
对共同连接网络的分布式优化算法的系统分析
Systematic Analysis of Distributed Optimization Algorithms over Jointly-Connected Networks
论文作者
论文摘要
我们考虑分布式优化问题，其中一组代理通过与邻近代理进行通信并执行本地计算来共同优化共同的目标。对于给定的算法，我们使用从鲁棒控制的工具来系统地分析通信网络时间变化的情况下的性能。特别是，我们仅假设网络是在有限的时间范围内共同连接的（通常称为B-连接性），这在每次瞬间不需要连接。当应用于分布式算法挖掘时，我们的边界比文献中可用的边界更紧。
We consider the distributed optimization problem, where a group of agents work together to optimize a common objective by communicating with neighboring agents and performing local computations. For a given algorithm, we use tools from robust control to systematically analyze the performance in the case where the communication network is time-varying. In particular, we assume only that the network is jointly connected over a finite time horizon (commonly referred to as B-connectivity), which does not require connectivity at each time instant. When applied to the distributed algorithm DIGing, our bounds are orders of magnitude tighter than those available in the literature.
