A Julia Module for Polynomial Optimization with Complex Variables applied to Optimal Power Flow

Many optimization problems in power transmission networks can be formulated as polynomial problems with complex variables. A polynomial optimization problem with complex variables consists in optimizing a real-valued polynomial whose variables and coefficients are complex numbers subject to some complex polynomial equality or inequality constraints. These problems are usually directly expressed with real variables. In this work, we propose a Julia module allowing the representation of polynomial problems in their original complex formulation. This module is applied to power system optimization and its generic design enables the description of several variants of power system problems. Results for the Optimal Power Flow in Alternating Current problem and for the Preventive-Security Constrained Optimal Power Flow problem are presented.

[1]  Alan Edelman,et al.  Julia: A Fast Dynamic Language for Technical Computing , 2012, ArXiv.

[3]  Florian Schäfer,et al.  Pandapower—An Open-Source Python Tool for Convenient Modeling, Analysis, and Optimization of Electric Power Systems , 2017, IEEE Transactions on Power Systems.

[4]  Steffen Rebennack,et al.  Optimal power flow: a bibliographic survey I , 2012, Energy Systems.

[5]  Russell Bent,et al.  Tight Piecewise Convex Relaxations for Global Optimization of Optimal Power Flow , 2018, 2018 Power Systems Computation Conference (PSCC).

[6]  Jean Charles Gilbert,et al.  Plea for a semidefinite optimization solver in complex numbers – The full report , 2017 .

[7]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[8]  Jean Charles Gilbert,et al.  Application of the Moment-SOS Approach to Global Optimization of the OPF Problem , 2013, IEEE Transactions on Power Systems.

[9]  Daniel K. Molzahn,et al.  Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization , 2015, 1508.02068.

[10]  Hadrien Godard,et al.  Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization , 2019, 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT).

[11]  Daniel K. Molzahn,et al.  Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables , 2017, SIAM J. Optim..

[12]  D. Ernst,et al.  Contingency Filtering Techniques for Preventive Security-Constrained Optimal Power Flow , 2007, IEEE Transactions on Power Systems.

[13]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[14]  Alper Atamtürk,et al.  A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables , 2016, Math. Program..

[15]  S. Low,et al.  Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.

[16]  A. Abdelaziz,et al.  Optimal Power Flow Methods : A Comprehensive Survey , 2022 .

[17]  Russell Bent,et al.  PowerModels.J1: An Open-Source Framework for Exploring Power Flow Formulations , 2017, 2018 Power Systems Computation Conference (PSCC).

[18]  Pascal Van Hentenryck,et al.  Strengthening the SDP Relaxation of AC Power Flows With Convex Envelopes, Bound Tightening, and Valid Inequalities , 2017, IEEE Transactions on Power Systems.

[19]  Pascal Van Hentenryck,et al.  AC-Feasibility on Tree Networks is NP-Hard , 2014, IEEE Transactions on Power Systems.

[20]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[21]  Santanu S. Dey,et al.  Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem , 2017, Math. Program. Comput..

[22]  J. Penot Conditioning convex and nonconvex problems , 1996 .

[23]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[24]  Daniel Bienstock,et al.  Strong NP-hardness of AC power flows feasibility , 2019, Oper. Res. Lett..

[25]  Ian A. Hiskens,et al.  Moment-based relaxation of the optimal power flow problem , 2013, 2014 Power Systems Computation Conference.

[26]  Miguel F. Anjos,et al.  Tight-and-Cheap Conic Relaxation for the AC Optimal Power Flow Problem , 2018, IEEE Transactions on Power Systems.

[27]  Stephen P. Boyd,et al.  Convex Optimization in Julia , 2014, 2014 First Workshop for High Performance Technical Computing in Dynamic Languages.

[28]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[29]  Iain Dunning,et al.  JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..

[30]  Xiaolong Kuang,et al.  Alternative LP and SOCP Hierarchies for ACOPF Problems , 2017, IEEE Transactions on Power Systems.

[31]  Steffen Rebennack,et al.  Optimal power flow: a bibliographic survey II , 2012, Energy Systems.

[32]  Richard P. O'Neill,et al.  History of Optimal Power Flow and Formulations Optimal Power Flow Paper 1 , 2012 .

[33]  Adam N. Letchford,et al.  Non-convex mixed-integer nonlinear programming: A survey , 2012 .

[34]  Ian A. Hiskens,et al.  Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem , 2014, IEEE Transactions on Power Systems.