Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow
This paper presents a class of non-convex quadratically constrained quadratic programs that can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a technical condition. We demonstrate its use on optimal power flow problems over radial networks.
© 2014 IEEE. It was supported by NSF through NetSE grant CNS 0911041, Southern California Edison, Cisco, and the Okawa Foundation.
Submitted - 1203.5599v2.pdf