Power System State Estimation via Feasible Point Pursuit: Algorithms and Cramér-Rao Bound

Accurately monitoring the system's operating point is central to the reliable and economic operation of an autonomous energy grid. Power system state estimation (PSSE) aims to obtain complete voltage magnitude and angle information at each bus given a number of system variables at selected buses and lines. Power flow analysis amounts to solving a set of noise-free power flow equations, and is cast as a special case of PSSE. Physical laws dictate quadratic relationships between available quantities and unknown voltages, rendering general instances of power flow and PSSE nonconvex and NP-hard. Past approaches are largely based on gradient-type iterative procedures or semidefinite relaxation (SDR). Due to nonconvexity, the solution obtained via gradient-type schemes depends on initialization, while SDR methods do not perform as desired in challenging scenarios. This paper puts forth novel feasible point pursuit (FPP)-based solvers for power flow analysis and PSSE, which iteratively seek feasible solutions for a nonconvex quadratically constrained quadratic programming reformulation of the weighted least-squares (WLS). Relative to the prior art, the developed solvers offer superior numerical performance at the cost of higher computational complexity. Furthermore, they converge to a stationary point of the WLS problem. As a baseline for comparing different estimators, the Cramér-Rao lower bound is derived for the fundamental PSSE problem in this paper. Judicious numerical tests on several IEEE benchmark systems showcase markedly improved performance of our FPP-based solvers for both power flow and PSSE tasks over popular WLS-based Gauss–Newton iterations and SDR approaches.