联合网络上分布式Optimization算法的系统分析
Systematic Analysis of Distributed Optimization Algorithms over Jointly-Connected Networks
摘要：
我们认为分布式最优化问题，一组代理一起工作，以优化一个共同的目标，通过与相邻的代理和执行本地计算。对于一个给定的算法，我们使用鲁棒控制的工具，系统地分析了性能的情况下，通信网络是时变的。特别地，我们仅假设网络在有限的时间范围内联合连接（通常称为B连通性），这不需要在每个时刻都连通。当应用到分布式算法DIGing，我们的界限是数量级比文献中提供的更紧。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
