Application of polynomial optimization to electricity transmission networks

Transmission system operators need to adapt their decision-making tools to the technological evolutions of the twenty first century. A computation inherent to most tools seeks to find alternating-current power flows that minimize power loss or generation cost. Mathematically, it consists in an optimization problem that can be described using only addition and multiplication of complex numbers. The objective of this thesis is to find global solutions, in other words the best solutions to the problem. One of the outcomes of this highly collaborative doctoral project is to use recent results from algebraic geometry to compute globally optimal power flows in the European high-voltage transmission network.

[1]  W. Wirtinger.  Zur formalen Theorie der Funktionen von mehr komplexen Veränderlichen , 1927 .

[2]  E. Artin.  Über die Zerlegung definiter Funktionen in Quadrate , 1927 .

[3]  J. Krivine,et al.  Anneaux préordonnés , 1964 .

[4]  D. Quillen,et al.  On the representation of hermitian forms as sums of squares , 1968 .

[5]  G. Stengle.  A nullstellensatz and a positivstellensatz in semialgebraic geometry , 1974 .

[6]  A. Atzmon.  A moment problem for positive measures on the unit disc. , 1975 .

[7]  S. Deckmann,et al.  Real-Time External Equivalents for Static Security Analysis , 1979, IEEE Transactions on Power Apparatus and Systems.

[8]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

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

[10]  R. Rockafellar.  Conjugate Duality and Optimization , 1987 .

[11]  Gautam Appa,et al.  Linear Programming in Infinite-Dimensional Spaces , 1989 .

[12]  Francisco D. Galiana,et al.  A survey of the optimal power flow literature , 1991 .

[13]  Kim C. Border,et al.  Infinite Dimensional Analysis: A Hitchhiker’s Guide , 1994 .

[14]  John P. D'Angelo,et al.  A stabilization theorem for Hermitian forms and applications to holomorphic mappings , 1995 .

[15]  Raúl E. Curto,et al.  Solution of the Truncated Complex Moment Problem for Flat Data , 1996 .

[16]  O. Toker,et al.  On the complexity of purely complex μ computation and related problems in multidimensional systems , 1998, IEEE Trans. Autom. Control..

[17]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[18]  A. Fialkow,et al.  THE TRUNCATED COMPLEX K-MOMENT PROBLEM , 2000 .

[19]  R. Curto,et al.  The quadratic moment problem for the unit circle and unit disk , 2000 .

[20]  Etienne de Klerk,et al.  Self-Dual Embeddings , 2000 .

[21]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[22]  Alexander Shapiro,et al.  DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS , 2000 .

[23]  Jan Stochel,et al.  Solving the truncated moment problem solves the full moment problem , 2001, Glasgow Mathematical Journal.

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

[25]  John P. D'Angelo,et al.  Inequalities from Complex Analysis , 2002 .

[26]  Shuzhong Zhang,et al.  On Cones of Nonnegative Quadratic Functions , 2003, Math. Oper. Res..

[27]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[28]  Alexander J. Smola,et al.  Kernels and Regularization on Graphs , 2003, COLT.

[29]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[30]  Zhi-Quan Luo,et al.  Blind constant modulus equalization via convex optimization , 2003, IEEE Trans. Signal Process..

[31]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[32]  Markus Schweighofer,et al.  Optimization of Polynomials on Compact Semialgebraic Sets , 2005, SIAM J. Optim..

[33]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[34]  Kilian Q. Weinberger,et al.  Graph Laplacian Regularization for Large-Scale Semidefinite Programming , 2006, NIPS.

[35]  Mihai Putinar,et al.  On hermitian polynomial optimization , 2006 .

[36]  R. Jabr.  Radial distribution load flow using conic programming , 2006, IEEE Transactions on Power Systems.

[37]  K. Fujisawa,et al.  Semidefinite programming for optimal power flow problems , 2008 .

[38]  M. Marshall.  Positive polynomials and sums of squares , 2008 .

[39]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[40]  K. Pandya,et al.  A SURVEY OF OPTIMAL POWER FLOW , 2008 .

[41]  Ronald R. Coifman,et al.  Graph Laplacian Tomography From Unknown Random Projections , 2008, IEEE Transactions on Image Processing.

[42]  John P. D'Angelo,et al.  Polynomial Optimization on Odd-Dimensional Spheres , 2009 .

[43]  P. P. Vaidyanathan,et al.  MIMO Radar Waveform Optimization With Prior Information of the Extended Target and Clutter , 2009, IEEE Transactions on Signal Processing.

[44]  Jean B. Lasserre,et al.  Convexity in SemiAlgebraic Geometry and Polynomial Optimization , 2008, SIAM J. Optim..

[45]  Didier Henrion,et al.  GloptiPoly 3: moments, optimization and semidefinite programming , 2007, Optim. Methods Softw..

[46]  Claus Scheiderer,et al.  Positivity and sums of squares: A guide to recent results , 2009 .

[47]  Visa Koivunen,et al.  Beampattern optimization by minimization of quartic polynomial , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.

[48]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

[49]  John P. D'Angelo,et al.  Hermitian analogues of Hilbert's 17-th problem , 2010, 1012.2479.

[50]  Anthony Sudbery,et al.  The geometric measure of multipartite entanglement and the singular values of a hypermatrix , 2010 .

[51]  On the two-dimensional moment problem , 2010, 1009.4821.

[52]  David Tse,et al.  Geometry of feasible injection region of power networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[53]  Mikhail Belkin,et al.  Laplacian Support Vector Machines Trained in the Primal , 2009, J. Mach. Learn. Res..

[54]  Etienne de Klerk,et al.  On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems , 2011, SIAM J. Optim..

[55]  J. Gallier.  Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[56]  A. Singer.  Angular Synchronization by Eigenvectors and Semidefinite Programming. , 2009, Applied and computational harmonic analysis.

[57]  Franz S. Hover,et al.  Laplacians for flow networks , 2011, SIAM J. Discret. Math..

[58]  K. Mani Chandy,et al.  Optimal power flow over tree networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[59]  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).

[60]  Jean B. Lasserre,et al.  Introduction to Semidefinite, Conic and Polynomial Optimization , 2012 .

[61]  John P. D'Angelo,et al.  HERMITIAN COMPLEXITY OF REAL POLYNOMIAL IDEALS , 2012 .

[62]  R. Jabr.  Exploiting Sparsity in SDP Relaxations of the OPF Problem , 2012, IEEE Transactions on Power Systems.

[63]  Rekha R. Thomas,et al.  Semidefinite Optimization and Convex Algebraic Geometry , 2012 .

[64]  Konrad Schm.  Around Hilbert's 17th Problem , 2012 .

[65]  Mihai Putinar,et al.  Hermitian algebra on the ellipse , 2012 .

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

[67]  J. Lavaei,et al.  Physics of power networks makes hard optimization problems easy to solve , 2012, 2012 IEEE Power and Energy Society General Meeting.

[68]  Zhening Li,et al.  Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications , 2012 .

[69]  Didier Henrion,et al.  Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions , 2011, IEEE Transactions on Automatic Control.

[70]  Lieven De Lathauwer,et al.  Unconstrained Optimization of Real Functions in Complex Variables , 2012, SIAM J. Optim..

[71]  Lorenz T. Biegler,et al.  Global optimization of Optimal Power Flow using a branch & bound algorithm , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[72]  L. Wehenkel,et al.  Contingency Ranking With Respect to Overloads in Very Large Power Systems Taking Into Account Uncertainty, Preventive, and Corrective Actions , 2013, IEEE Transactions on Power Systems.

[73]  Augusto Aubry,et al.  Ambiguity Function Shaping for Cognitive Radar Via Complex Quartic Optimization , 2013, IEEE Transactions on Signal Processing.

[74]  J. Lavaei,et al.  Network Topologies Guaranteeing Zero Duality Gap for Optimal Power Flow Problem , 2013 .

[75]  Joshua A. Taylor,et al.  Conic AC transmission system planning , 2013, IEEE Transactions on Power Systems.

[76]  Jesse T. Holzer,et al.  Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite Programming , 2013, IEEE Transactions on Power Systems.

[77]  Claus Scheiderer,et al.  Quillen property for real algebraic varieties , 2013 .

[78]  Paul A. Trodden,et al.  Local Solutions of the Optimal Power Flow Problem , 2013, IEEE Transactions on Power Systems.

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

[80]  Jiawang Nie,et al.  Optimality conditions and finite convergence of Lasserre’s hierarchy , 2012, Math. Program..

[81]  Martin S. Andersen,et al.  Reduced-Complexity Semidefinite Relaxations of Optimal Power Flow Problems , 2013, IEEE Transactions on Power Systems.

[82]  Shuzhong Zhang,et al.  Approximation methods for complex polynomial optimization , 2014, Comput. Optim. Appl..

[83]  Ian A. Hiskens,et al.  Semidefinite relaxations of equivalent optimal power flow problems: An illustrative example , 2015, 2015 IEEE International Symposium on Circuits and Systems (ISCAS).

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

[85]  K. Mani Chandy,et al.  Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow , 2012, IEEE Transactions on Control of Network Systems.

[86]  Javad Lavaei,et al.  Convexification of power flow problem over arbitrary networks , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

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

[88]  Joshua A. Taylor.  Convex Optimization of Power Systems , 2015 .

[89]  Ian A. Hiskens,et al.  Mixed SDP/SOCP moment relaxations of the optimal power flow problem , 2015, 2015 IEEE Eindhoven PowerTech.

[90]  Javad Lavaei,et al.  Convex Relaxation for Optimal Power Flow Problem: Mesh Networks , 2015, IEEE Transactions on Power Systems.

[91]  Ian A. Hiskens,et al.  Solution of optimal power flow problems using moment relaxations augmented with objective function penalization , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

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

[93]  Yonina C. Eldar,et al.  Phase Retrieval via Matrix Completion , 2011, SIAM Rev..

[94]  Shuzhong Zhang,et al.  Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations , 2015, SIAM J. Matrix Anal. Appl..

[95]  Jakub Marecek,et al.  Optimal Power Flow as a Polynomial Optimization Problem , 2014, IEEE Transactions on Power Systems.

[96]  Alexandre d'Aspremont,et al.  Phase retrieval for imaging problems , 2013, Mathematical Programming Computation.

[97]  Javad Lavaei,et al.  Promises of Conic Relaxation for Contingency-Constrained Optimal Power Flow Problem , 2014, IEEE Transactions on Power Systems.

[98]  Jean Maeght,et al.  AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE , 2016, 1603.01533.

[99]  Didier Henrion,et al.  Strong duality in Lasserre’s hierarchy for polynomial optimization , 2014, Optim. Lett..

[100]  Santanu S. Dey,et al.  Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow , 2014, IEEE Transactions on Power Systems.

[101]  Ian Hiskens,et al.  A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems , 2015, IEEE Transactions on Power Systems.

[102]  Amit Singer,et al.  Tightness of the maximum likelihood semidefinite relaxation for angular synchronization , 2014, Math. Program..