A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids

Abstract

State estimation in power grids is a crucial step for monitoring and control tasks. It was shown that the state estimation problem can be solved using a convex relaxation based on semi-definite programming. In the present paper, we propose a fast algorithm for solving this relaxation. Our approach uses the Bürer Monteiro factorisation in a special way that solves the problem on the sphere and estimates the scale in a Gauss-Seidel fashion. Simulation results confirm the promising behaviour of the method.