Published March 2014
| Version Submitted
Book Section - Chapter
Open
Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow
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.
Additional Information
© 2014 IEEE. It was supported by NSF through NetSE grant CNS 0911041, Southern California Edison, Cisco, and the Okawa Foundation.Attached Files
Submitted - 1203.5599v2.pdf
Files
1203.5599v2.pdf
Files
(675.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:7b6c787a151ec9091ae566e140589346
|
675.2 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 57140
- DOI
- 10.1109/CISS.2014.6814135
- Resolver ID
- CaltechAUTHORS:20150501-091249022
Related works
- Describes
- 10.1109/CISS.2014.6814135 (DOI)
- http://arxiv.org/abs/1203.5599 (URL)
Funding
- NetSE
- CNS 0911041
- Southern California Edison
- Cisco
- Okawa Foundation
Dates
- Created
-
2015-05-01Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field