2014/07/18 by Weiye Zheng, Zheng, Weiye, Wenchuan Wu +7
Computer Science · Engineering · Mathematics · #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Microgrid Control and Optimization #Optimal Power Flow Distribution #Optimization and Control (math.OC) #Parallel #Smart Grid Energy Management #and Cluster Computing (cs.DC) #cs.DC #math.OC
paper · pdf · doi:10.48550/arxiv.1407.5032
This paper has been withdrawn by the author due to a crucial sign error in equations 11 and 26. Also, in P1, active powers have been optimized, which is not suitable. Some crucial assumptions about DGs are not explicitly addressed, either
openalex publication_date 2014/07/18 · arxiv created 2014/09/11 · arxiv updated 2014/09/12 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
This paper proposes a fully distributed reactive power optimization algorithm that can obtain the global optimum of non-convex problems for distribution networks without a central coordinator. Second-order cone (SOC) relaxation is used to achieve exact convexification. A fully distributed algorithm is then formulated corresponding to the given division of areas based on an alternating direction method of multipliers (ADMM) algorithm, which is greatly simplified by exploiting the structure of active distribution networks (ADNs). The problem is solved for each area with very little interchange of boundary information between neighboring areas. The standard ADMM algorithm is extended using a varying penalty parameter to improve convergence. The validity of the method is demonstrated via numerical simulations on an IEEE 33-node distribution network, a PG&E 69-node distribution system, and an extended 137-node system.