Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 2014 | Submitted
Book Section - Chapter Open

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.

Additional Information

© 2014 IEEE. It was supported by NSF through NetSE grant CNS 0911041, Southern California Edison, Cisco, and the Okawa Foundation.

Attached Files

Submitted - 1203.5599v2.pdf


Files (675.2 kB)
Name Size Download all
675.2 kB Preview Download

Additional details

August 19, 2023
October 23, 2023