An Overview of Semidefinite Relaxations for Optimal Power Flow Problem

The AC optimal power flow (AC OPF) problem is considered and five convex relaxations for solving this problem—the semidefinite, chordal, conic, and moment-based ones as well as the QC relaxation—are overviewed. The specifics of the AC formulation and also the nonconvexity of the problem are described in detail. Each of the relaxations for OPF is written in explicit form. The semidefinite, chordal and conic relaxations are of major interest. They are implemented on a test example of four nodes.

[1]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[2]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[3]  Steven H. Low,et al.  Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence , 2014, IEEE Transactions on Control of Network Systems.

[4]  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.

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

[6]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[7]  R. Belmans,et al.  A literature survey of Optimal Power Flow problems in the electricity market context , 2009, 2009 IEEE/PES Power Systems Conference and Exposition.

[8]  J. Momoh.  Electric Power System Applications of Optimization , 2000 .

[9]  Carleton Coffrin,et al.  The QC relaxation: A theoretical and computational study on optimal power flow , 2016, 2017 IEEE Power & Energy Society General Meeting.

[10]  Ivan Zorin,et al.  Fragility of the semidefinite relaxation for the optimal power flow problem , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[11]  J. Lasserre.  Moments, Positive Polynomials And Their Applications , 2009 .

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

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

[14]  O. Alsaç,et al.  DC Power Flow Revisited , 2009, IEEE Transactions on Power Systems.

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

[16]  Steven H. Low,et al.  Convex Relaxation of Optimal Power Flow—Part II: Exactness , 2014, IEEE Transactions on Control of Network Systems.

[17]  Pascal Van Hentenryck,et al.  Convex quadratic relaxations for mixed-integer nonlinear programs in power systems , 2016, Mathematical Programming Computation.

[18]  Florin Capitanescu,et al.  Critical review of recent advances and further developments needed in AC optimal power flow , 2016 .

[19]  Hugo J. Woerdeman,et al.  Minimal rank completions for block matrices , 1989 .

[20]  Ufuk Topcu,et al.  Exact Convex Relaxation of Optimal Power Flow in Radial Networks , 2013, IEEE Transactions on Automatic Control.

[21]  Daniel K. Molzahn,et al.  Examining the limits of the application of semidefinite programming to power flow problems , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[22]  Babak Hassibi,et al.  Equivalent Relaxations of Optimal Power Flow , 2014, IEEE Transactions on Automatic Control.