skip to content

Computational Methods for Nonlinear Power Operational Problems: Convex Reformulations and Near-Linear Time Algorithms

Presented by: 
Javad Lavaei
Tuesday 8th January 2019 - 11:30 to 12:30
INI Seminar Room 1
Session Title: 
Methods vs Problems
Co-authors: Somayeh Sojoudi (UC Berkeley), Richard Zhang (UC Berkeley), Salar Fattahi (UC Berkeley), Igor Molybog (UC Berkeley), Ming Jin (UC Berkeley), SangWoo Park (UC Berkeley)In this talk, we will study a set of nonlinear power optimization and decision-making problems, namely power flow, optimal power flow, state estimation and topology error detection. We will propose different conic relaxation and approximation techniques to solve these nonconvex problems. We will prove that such conic problems could be solved in near linear time due to intrinsic properties of real-world power networks. We will offer case studies on systems with as high as 14,000 nodes.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons