Title :
Exploiting Sparsity in SDP Relaxations of the OPF Problem
Author_Institution :
Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Beirut, Lebanon
fDate :
5/1/2012 12:00:00 AM
Abstract :
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.
Keywords :
load flow; mathematical programming; matrix algebra; OPF problem; SDP relaxations; optimal power flow problem; positive semideflnite matrix completion; primal-dual interior-point based SDP solutions; primal-dual interior-point based semideflnite programming solutions; Joining processes; Linear matrix inequalities; Matrix converters; Programming; Resistance; Sparse matrices; Symmetric matrices; Mathematical programming; optimal power flow; semidefinite programming;
Journal_Title :
Power Systems, IEEE Transactions on
DOI :
10.1109/TPWRS.2011.2170772
