A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
2017
Journal of Industrial and Management Optimization
Preserved Fulltext
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
doi:10.3934/jimo.2018161
fatcat:qs2jhpasezczhp745jcmhj27wm