English

A hard-constrained NN learning framework for rapidly restoring AC-OPF from DC-OPF

Systems and Control 2026-02-09 v1 Systems and Control

Abstract

This paper proposes a hard-constrained unsupervised learning framework for rapidly solving the non-linear and non-convex AC optimal power flow (AC-OPF) problem in real-time operation. Without requiring ground-truth AC-OPF solutions, feasibility and optimality are ensured through a properly designed learning environment and training loss. Inspired by residual learning, the neural network (NN) learns the correction mapping from the DC-OPF solution to the active power setpoints of the generators through re-dispatch. A subsequent optimization model is utilized to restore the optimal AC-OPF solution, and the resulting projection difference is employed as the training loss. A replay buffer is utilized to enhance learning efficiency by fully leveraging past data pairs. The optimization model is cast as a differentiable optimization layer, where the gradient is derived by applying the implicit function theorem to the KKT conditions at the optimal solution. Tested on IEEE-118 and PEGASE-9241 bus systems, numerical results demonstrate that the proposed NN can obtain strictly feasible and near-optimal solutions with reduced computational time compared to conventional optimization solvers. In addition, aided by the updated DC-OPF solution under varying topologies, the trained NN, together with the PF solver, can rapidly find the corresponding AC solution. The proposed method achieves a 40×40\times time speedup, while maintaining an average constraint violation on the order of 10410^{-4} and an optimization gap below 1%1\%.

Keywords

Cite

@article{arxiv.2602.06255,
  title  = {A hard-constrained NN learning framework for rapidly restoring AC-OPF from DC-OPF},
  author = {Kejun Chen and Bernard Knueven and Wesley Jones},
  journal= {arXiv preprint arXiv:2602.06255},
  year   = {2026}
}
R2 v1 2026-07-01T10:23:30.360Z