.png){kind=icon}
.png){kind=icon}
Return
GPU Accelerated Security Constrained Optimal Power Flow
.png){kind=icon}
PRE
AI
DOI：10.1007/s11081-026-10085-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a GPU accelerated proximal message passing algorithm for solving contingency-constrained DC optimal power flow problems (OPF). We consider a highly general formulation of OPF that uses a sparse device-node model and supports a broad range of devices and constraints, e.g., energy storage and ramping limits. Our algorithm is a variant of the alternating direction method of multipliers (ADMM) that does not require solving any linear systems and only consists of sparse incidence matrix multiplies and vectorized scalar operations. We develop a pure PyTorch implementation of our algorithm that runs entirely on the GPU. The implementation is also end-to-end differentiable, i.e., all updates are automatic differentiation compatible. We demonstrate the performance of our method using test cases of varying network sizes and time horizons. Relative to a CPU-based commercial optimizer, our implementation achieves well over 100 & times;\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} speedups on large test cases, solving problems with over 500 million variables in under a minute on a single GPU.
Keywords:
DC-OPF
ADMM
ALGORITHM