After decades of research, efficient computation of AC Optimal Power Flow (ACOPF) still remains a challenge. ACOPF is a nonlinear nonconvex problem, and operators would need to solve ACOPF for large networks in almost real-time. Sequential Quadratic Programming (SQP) is one of the powerful second-order methods for solving large-scale nonlinear optimization problems and is a suitable approach for solving ACOPF with large-scale real-world transmission networks. However, SQP, in its general form, is still unable to solve large-scale problems within industry time limits. This paper presents a customized Sequential Quadratic Programming (CSQP) algorithm, taking advantage of physical properties of the ACOPF problem and the choice of the best performing ACOPF formulation. The numerical experiments suggest that CSQP outperforms commercial and noncommercial nonlinear solvers and solves test cases within the industry time limits. A wide range of test cases, ranging from 500-bus systems to 30,000-bus systems, are used to verify the test results.
Customized Sequential Quadratic Programming for Solving Large-Scale AC Optimal Power Flow
