A Distributed Approach for the Optimal Power-Flow Problem Based on ADMM and Sequential Convex Approximations

DOI10.1109/TCNS.2015.2399192zbMATH Open1370.90045arXiv1401.4621OpenAlexW2962964418MaRDI QIDQ5358461FDOQ5358461

Authors: Sindri Magnússon, Pradeep Chathuranga Weeraddana, Carlo Fischione 

Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Abstract: The optimal power flow (OPF) problem, which plays a central role in operating electrical networks is considered. The problem is nonconvex and is in fact NP hard. Therefore, designing efficient algorithms of practical relevance is crucial, though their global optimality is not guaranteed. Existing semi-definite programming relaxation based approaches are restricted to OPF problems where zero duality holds. In this paper, an efficient novel method to address the general nonconvex OPF problem is investigated. The proposed method is based on alternating direction method of multipliers combined with sequential convex approximations. The global OPF problem is decomposed into smaller problems associated to each bus of the network, the solutions of which are coordinated via a light communication protocol. Therefore, the proposed method is highly scalable. The convergence properties of the proposed algorithm are mathematically substantiated. Finally, the proposed algorithm is evaluated on a number of test examples, where the convergence properties of the proposed algorithm are numerically substantiated and the performance is compared with a global optimal method.

Full work available at URL: https://arxiv.org/abs/1401.4621

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Distributed algorithms (68W15)

Cited In (8)

• Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
• Primal-dual stochastic distributed algorithm for constrained convex optimization
• Bounding duality gap for separable problems with linear constraints
• A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
• Distributed discrete-time optimization algorithms with applications to resource allocation in epidemics control
• Feasibility vs. Optimality in Distributed AC OPF: A Case Study Considering ADMM and ALADIN
• A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
• A two-level distributed algorithm for nonconvex constrained optimization

This page was built for publication: A Distributed Approach for the Optimal Power-Flow Problem Based on ADMM and Sequential Convex Approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358461)