Published September 2015
| Submitted
Journal Article
Open
Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
Chicago
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
- Eprint ID
- 80069
- DOI
- 10.1109/TCNS.2015.2401172
- Resolver ID
- CaltechAUTHORS:20170810-100823060
- NSF
- CNS-0911041
- Department of Energy (DOE)
- DE-AR0000226
- Southern California Edison
- National Science Council (Taipei)
- NSC 103-3113-P-008-001
- Resnick Sustainability Institute
- Created
-
2017-08-10Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field
- Caltech groups
- Resnick Sustainability Institute