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.
No takes yet. Share an insight, caveat, or question.
Rabih A. Jabr (2011) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: