凸与鲁棒分布式优化的多面体近似框架
A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
AI总结:
提出一种名为切割平面共识的分布式算法,通过外部多面体近似约束集,解决对等网络中的凸与鲁棒分布式优化问题,具有可扩展性和容错性。
摘要:
本文考虑对等网络中一大类凸与鲁棒分布式优化问题的通用问题设置。在该设置中,凸约束集分布到网络处理器上,这些处理器需要计算受约束的线性成本函数的最优解。我们提出了一种新颖的完全分布式算法,称为切割平面共识,基于约束集的外部多面体近似来解决问题。运行该算法的处理器计算并交换其局部可行集的线性近似。无论网络中的处理器数量如何,每个处理器仅存储少量线性约束,使得算法可扩展到大型网络。针对通用框架,我们介绍并分析了切割平面共识算法。具体地,我们证明运行该算法的所有处理器都同意全局问题的最优解,并且只要网络连通性保持,算法就能容忍节点和链路故障。然后,将切割平面共识算法具体应用于三类不同的分布式优化问题,即(i)不等式约束问题,(ii)鲁棒优化问题,以及(iii)具有可分离目标函数和耦合约束的几乎可分离优化问题。对于每一类问题,我们求解一个可以在该框架中表达的具体问题,并给出计算结果。即,我们展示了如何求解:无线传感器网络中的位置估计、分布式鲁棒线性规划以及分布式微电网控制问题。
英文摘要:
In this paper we consider a general problem set-up for a wide class of convex and robust distributed optimization problems in peer-to-peer networks. In this set-up convex constraint sets are distributed to the network processors who have to compute the optimizer of a linear cost function subject to the constraints. We propose a novel fully distributed algorithm, named cutting-plane consensus, to solve the problem, based on an outer polyhedral approximation of the constraint sets. Processors running the algorithm compute and exchange linear approximations of their locally feasible sets. Independently of the number of processors in the network, each processor stores only a small number of linear constraints, making the algorithm scalable to large networks. The cutting-plane consensus algorithm is presented and analyzed for the general framework. Specifically, we prove that all processors running the algorithm agree on an optimizer of the global problem, and that the algorithm is tolerant to node and link failures as long as network connectivity is preserved. Then, the cutting plane consensus algorithm is specified to three different classes of distributed optimization problems, namely (i) inequality constrained problems, (ii) robust optimization problems, and (iii) almost separable optimization problems with separable objective functions and coupling constraints. For each one of these problem classes we solve a concrete problem that can be expressed in that framework and present computational results. That is, we show how to solve: position estimation in wireless sensor networks, a distributed robust linear program and, a distributed microgrid control problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。