Customized Sequential Quadratic Programming for Solving Large-Scale AC Optimal Power Flow
Authors:
- 14 November 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
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.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Solving OPF using linear approximations: fundamental analysis and numerical demonstrationIET Generation, Transmission & Distribution, 2017
- Mixed integer linear programming formulation for chance constrained mathematical programs with equilibrium constraints2017
- Optimal power flow based on successive linear approximation of power flow equationsIET Generation, Transmission & Distribution, 2016
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systemsMathematical Programming Computation, 2016
- Optimal Reactive Power Dispatch With Accurately Modeled Discrete Control Devices: A Successive Linear Approximation ApproachIEEE Transactions on Power Systems, 2016
- A successive linear programming approach to solving the iv-acopfIEEE Transactions on Power Systems, 2015
- Convex Relaxation for Optimal Power Flow Problem: Mesh NetworksIEEE Transactions on Power Systems, 2014
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and EquivalenceIEEE Transactions on Control of Network Systems, 2014
- Zero Duality Gap in Optimal Power Flow ProblemIEEE Transactions on Power Systems, 2011
- DC Power Flow RevisitedIEEE Transactions on Power Systems, 2009