arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.6685eess.SYcs.DCcs.SYmath.OC
收藏

分布式优化:从动力系统视角的收敛条件

Distributed Optimization: Convergence Conditions from a Dynamical System Perspective

ACCESS Linnaeus Centre, School of Electrical Engineering, Royal Institute of Technology(林奈中心电气工程学院,皇家理工学院)

Guodong Shi, Alexandre Proutiere, Karl Henrik Johansson

AI总结:

本文从动力系统角度研究分布式优化问题,证明局部目标函数解集非空交集是全局最优一致性的关键条件,并针对固定图和时变图分别给出控制律设计。

摘要:

本文探讨了分布式最小化函数和的基本性质,其中每个函数仅由一个节点知晓,且节点具有预定的知识水平和计算能力。我们定义了每个节点从其目标函数接收的优化信息、每个节点从其邻居接收的邻居信息以及每个节点在控制其状态时可利用的计算能力。证明了存在一种邻居信息方式和一种控制律,当且仅当局部目标函数的解集在固定强连通图中具有非空交集时,才能保证全局最优一致性。然后我们表明,对于任何容许误差,在温和条件下,对于固定、双向且连通的图,我们可以找到一种控制律,保证在该误差内达到全局最优一致性。对于时变图,我们表明只要图是一致联合强连通的且非空交集条件成立,总能实现最优一致性。结果表明,局部最优解集的非空交集是一大类算法成功进行分布式优化的关键条件。

英文摘要:

This paper explores the fundamental properties of distributed minimization of a sum of functions with each function only known to one node, and a pre-specified level of node knowledge and computational capacity. We define the optimization information each node receives from its objective function, the neighboring information each node receives from its neighbors, and the computational capacity each node can take advantage of in controlling its state. It is proven that there exist a neighboring information way and a control law that guarantee global optimal consensus if and only if the solution sets of the local objective functions admit a nonempty intersection set for fixed strongly connected graphs. Then we show that for any tolerated error, we can find a control law that guarantees global optimal consensus within this error for fixed, bidirectional, and connected graphs under mild conditions. For time-varying graphs, we show that optimal consensus can always be achieved as long as the graph is uniformly jointly strongly connected and the nonempty intersection condition holds. The results illustrate that nonempty intersection for the local optimal solution sets is a critical condition for successful distributed optimization for a large class of algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑