Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow

Subhonmesh Bose; Dennice F. Gayme; K. Mani Chandy; Steven H. Low

doi:10.1109/TCNS.2015.2401172

Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow

Subhonmesh Bose, Dennice F. Gayme, K. Mani Chandy, Steven H. Low

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1109/TCNS.2015.2401172
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

Online availability

10.1109/TCNS.2015.2401172

Library availability

Discover UIUC Full Text

Cite this

@article{edbf50c849314da7a390649463dc183c,

title = "Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow",

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 = "Conic relaxation, optimal power flow, semidefinite programming",

author = "Subhonmesh Bose and Gayme, {Dennice F.} and Chandy, {K. Mani} and Low, {Steven H.}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.",

year = "2015",

month = sep,

day = "1",

doi = "10.1109/TCNS.2015.2401172",

language = "English (US)",

volume = "2",

pages = "278--287",

journal = "IEEE Transactions on Control of Network Systems",

issn = "2325-5870",

publisher = "IEEE CONTROL SYSTEMS SOCIETY",

number = "3",

}

TY - JOUR

T1 - Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow

AU - Bose, Subhonmesh

AU - Gayme, Dennice F.

AU - Chandy, K. Mani

AU - Low, Steven H.

PY - 2015/9/1

Y1 - 2015/9/1

N2 - 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.

AB - 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.

KW - Conic relaxation

KW - optimal power flow

KW - semidefinite programming

UR - http://www.scopus.com/inward/record.url?scp=84959288321&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959288321&partnerID=8YFLogxK

U2 - 10.1109/TCNS.2015.2401172

DO - 10.1109/TCNS.2015.2401172

M3 - Article

AN - SCOPUS:84959288321

SN - 2325-5870

VL - 2

SP - 278

EP - 287

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

IS - 3

M1 - 7035094

ER -

Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this