Stability and convergence of distributed algorithms for the OPF problem

Many modern power networks are partitioned in nature, with disjoint components of the overall network con rolled 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.