Abstract
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.
| Original language | English (US) |
|---|---|
| DOIs | |
| State | Published - 2014 |
| Externally published | Yes |
| Event | 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States Duration: Mar 19 2014 → Mar 21 2014 |
Other
| Other | 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 |
|---|---|
| Country/Territory | United States |
| City | Princeton, NJ |
| Period | 3/19/14 → 3/21/14 |
Keywords
- Conic relaxation
- optimal power flow
ASJC Scopus subject areas
- Information Systems