An Efficient GPU-Based Halpern Accelerating Algorithm for Large-Scale DC Optimal Power Flow
- 21 November 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (3) , 2187-2204
Abstract
With numerous renewable generators and energy storage systems integrated into the power grids, the security-constrained DC optimal power flow (DCOPF) is essential for power system operation. For large-scale power grids, traditional CPU-based optimization algorithms (such as the simplex and barrier methods) have saturated in computational efficiency and are inherently difficult to parallelize. To tackle these issues, by incorporating the symmetric Gauss–Seidel (sGS) decomposition, this work develops a GPU-based Halpern Peaceman-Rachford algorithm, termed the sGS-HPR, which enjoys an $O(1/k)$ iteration complexity in terms of the KKT residual. Moreover, the closed-form solutions for all subproblems are derived, which only consist of matrix-vector multiplications and vector operations, and thus can be easily parallelized on GPUs. As a consequence, the developed sGS-HPR algorithm enjoys a $O({N_{L} \times n} / \epsilon)$ non-ergodic computational complexity in terms of floating-point operations for obtaining an $\epsilon$-optimal solution measured by the KKT residual for large-scale DCOPF problems, where $n$ represents the variable dimension, and $N_{L}$ denotes the number of branches in the power grid. Extensive numerical tests on large-scale power grids, reaching up to the 9241-bus PEGASE system, demonstrate the scalability and superior efficiency of the developed GPU-based sGS-HPR algorithm compared to state-of-the-art methods. Notably, the proposed method achieves a 6× speedup compared with Gurobi for large-scale instances. Additionally, for ultra-large-scale cases, Gurobi throws an “out-of-memory” error, while the proposed sGS-HPR algorithm maintains its computational scalability and efficiency.Keywords
Funding Information
- Postdoc Matching Fund Scheme (1-W38P)
- National Natural Science Foundation of China (U24B6009)
- Natural Science Foundation of Beijing Municipality (L243003)
- National Natural Science Foundation of China (12271015)
- Research Center for Intelligent Operations Research
- RGC Senior Research Fellow Scheme (SRFS2223-5S02)
- GRF (15307822)
This publication has 54 references indexed in Scilit:
- An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain SystemsJournal of Optimization Theory and Applications, 2024
- Faster first-order primal-dual methods for linear programming using restarts and sharpnessMathematical Programming, 2022
- A block symmetric Gauss–Seidel decomposition theorem for convex composite quadratic programming and its applicationsMathematical Programming, 2018
- On the Convergence Properties of a Majorized Alternating Direction Method of Multipliers for Linearly Constrained Convex Optimization Problems with Coupled Objective FunctionsJournal of Optimization Theory and Applications, 2016
- Convergence Rate Analysis of Several Splitting Schemes2016
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensionsMathematical Programming, 2014
- A First-Order Primal-Dual Algorithm for Convex Problems with Applications to ImagingJournal of Mathematical Imaging and Vision, 2010
- Variational Analysis1998
- Approximation of fixed points of nonexpansive mappingsArchiv der Mathematik, 1992
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992