Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow

被引：0
|
作者：
Bose, Subhonmesh [1 ]
Gayme, Dennice F. [2 ]
Chandy, K. Mani [1 ]
Low, Steven H. [1 ]
机构：
[1] CALTECH, Pasadena, CA 91125 USA
[2] Johns Hopkins Univ, Baltimore, MD 21218 USA
来源：
2014 48TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS) | 2014年
关键词：
Conic relaxation; optimal power flow; INTERIOR-POINT METHOD; SEMIDEFINITE;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页数：5
相关论文
共 50 条
12345