Srikantha, PirathayiniM. Mallick2021-08-302021-08-302020-05P. Srikantha and M. Mallick, "Hidden Convexities in Decentralized Coordination for the Distribution Networks," in IEEE Transactions on Power Systems, vol. 35, no. 6, pp. 4470-4483, Nov. 2020.0885-8950http://dx.doi.org/10.1109/TPWRS.2020.2993453http://hdl.handle.net/10315/38533The modern power grid is undergoing unprecedented levels of transformations due to the rising prevalence of diverse power entities, cyber-enablement of grid components and energy deregulations. In this paper, we focus on distribution networks (DNs) to enable the seamless plug-and-play coordination of actuating cyber-enabled power entities for cost-effective and feasible system operations. The proposed distributed algorithm empowers individual cyber-physical agents residing in active power nodes with the ability to iteratively compute local actuation setpoints by exchanging information with neighbouring entities. The main contribution of this work is the identification of hidden convexities in the original non-convex optimal power flow (OPF) formulation for the DN via strategic decomposition and strong duality principles. These eliminate the need for OPF relaxations/approximations. Strong convergence and feasibility results are presented via theoretical analysis and practical simulation studies conducted on realistic systems.en© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.power system managementiterative algorithmsconvex optimizationArticlehttps://ieeexplore.ieee.org/document/9090318https://www.ieee.org/https://ieeexplore.ieee.org/document/9090318