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

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

Research output: Contribution to conferencePaper

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 languageEnglish (US)
DOIs
StatePublished - Jan 1 2014
Event2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States
Duration: Mar 19 2014Mar 21 2014

Other

Other2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
CountryUnited States
CityPrinceton, NJ
Period3/19/143/21/14

Fingerprint

Polynomials

Keywords

  • Conic relaxation
  • optimal power flow

ASJC Scopus subject areas

  • Information Systems

Cite this

Bose, S., Gayme, D. F., Chandy, K. M., & Low, S. H. (2014). Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States. https://doi.org/10.1109/CISS.2014.6814135

Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow. / Bose, Subhonmesh; Gayme, Dennice F.; Chandy, K. Mani; Low, Steven H.

2014. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States.

Research output: Contribution to conferencePaper

Bose, S, Gayme, DF, Chandy, KM & Low, SH 2014, 'Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow' Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States, 3/19/14 - 3/21/14, . https://doi.org/10.1109/CISS.2014.6814135
Bose S, Gayme DF, Chandy KM, Low SH. Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow. 2014. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States. https://doi.org/10.1109/CISS.2014.6814135
Bose, Subhonmesh ; Gayme, Dennice F. ; Chandy, K. Mani ; Low, Steven H. / Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow. Paper presented at 2014 48th Annual Conference on Information Sciences and Systems, CISS 2014, Princeton, NJ, United States.
@conference{d8932c181e7f4f47b8a97aea663c3e7b,
title = "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.",
keywords = "Conic relaxation, optimal power flow",
author = "Subhonmesh Bose and Gayme, {Dennice F.} and Chandy, {K. Mani} and Low, {Steven H.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/CISS.2014.6814135",
language = "English (US)",
note = "2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 ; Conference date: 19-03-2014 Through 21-03-2014",

}

TY - CONF

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

AU - Bose, Subhonmesh

AU - Gayme, Dennice F.

AU - Chandy, K. Mani

AU - Low, Steven H.

PY - 2014/1/1

Y1 - 2014/1/1

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

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

KW - Conic relaxation

KW - optimal power flow

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

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

U2 - 10.1109/CISS.2014.6814135

DO - 10.1109/CISS.2014.6814135

M3 - Paper

AN - SCOPUS:84901402762

ER -