DocumentCode
741979
Title
Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
Author
Bose, Subhonmesh ; Gayme, Dennice F. ; Chandy, K. Mani ; Low, Steven H.
Volume
2
Issue
3
fYear
2015
Firstpage
278
Lastpage
287
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.
Keywords
Control systems; Linear programming; Optimization; Polynomials; Vectors; Vegetation; Conic relaxation; optimal power flow; semidefinite programming;
fLanguage
English
Journal_Title
Control of Network Systems, IEEE Transactions on
Publisher
ieee
ISSN
2325-5870
Type
jour
DOI
10.1109/TCNS.2015.2401172
Filename
7035094
Link To Document