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.
Original language | English (US) |
---|---|
Article number | 7035094 |
Pages (from-to) | 278-287 |
Number of pages | 10 |
Journal | IEEE Transactions on Control of Network Systems |
Volume | 2 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1 2015 |
Externally published | Yes |
Keywords
- Conic relaxation
- optimal power flow
- semidefinite programming
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Computer Networks and Communications
- Control and Optimization