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 September 2015 | Submitted
Journal Article Open

Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

Abstract

This paper proves that nonconvex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. We demonstrate this theory on optimal power-flow problems over tree networks.

Additional Information

© 2015 IEEE. Manuscript received April 8, 2014; revised September 28, 2014; accepted November 17, 2014. Date of publication February 6, 2015; date of current version September 14, 2015. This work was supported in part by the National Science Foundation through NetSE CNS 0911041, in part by the ARPA-E through GENI DE AR0000226, in part by Southern California Edison, in part by the National Science Council of Taiwan through NSC 103-3113-P-008-001, in part by the Los Alamos National Lab (DoE), and in part by the Caltech's Resnick Institute. Recommended by Associate Editor M. Chertkov.

Attached Files

Submitted - 1203.5599.pdf

Files

1203.5599.pdf
Files (675.2 kB)
Name Size Download all
md5:7b6c787a151ec9091ae566e140589346
675.2 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 17, 2023