Key points are not available for this paper at this time.
This letter presents a framework for exploiting sparsity in primal-dual interior-point based semidefinite programming (SDP) solutions of the optimal power flow (OPF) problem. It is shown that a formulation based on positive semidefinite matrix completion results in a drastic reduction in computational effort.
Rabih A. Jabr (Tue,) studied this question.