Stability and convergence of distributed algorithms for the OPF problem
Stability and convergence of distributed algorithms for the OPF problem
复制标题
DOI：
10.1109/cdc.2013.6760329
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
E. Devane;Ioannis Lestas
中科院分区：
文献类型：
--
作者：
E. Devane;Ioannis Lestas
许多现代电网本质上是分区的，整个电网的不相连部分由相互竞争的运营商控制。因此，以分布式方式解决最优潮流（OPF）问题具有重要的意义。对于高层结构具有树形拓扑的网络，我们分析了一种对偶分解方法，以分布式方式解决整个网络的OPF问题的最近凸松弛问题。结合局部辅助变量的高阶动力学，我们证明了对于足够小的步长值解集的保证收敛的结果。
Many modern power networks are partitioned in nature, with disjoint components of the overall network controlled by competing operators. The problem of solving the Optimal Power Flow (OPF) problem in a distributed manner is therefore of significant interest. For networks in which the high-level structure has tree topology, we analyze a dual decomposition approach to solving a recent convex relaxation of the OPF problem for the overall network in a distributed manner. Incorporating higher-order dynamics in terms of local auxiliary variables, we prove a result of guaranteed convergence to the solution set for sufficiently small values of the step size.