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 journalArticlepeer-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 languageEnglish (US)
Article number7035094
Pages (from-to)278-287
Number of pages10
JournalIEEE Transactions on Control of Network Systems
Volume2
Issue number3
DOIs
StatePublished - Sep 1 2015
Externally publishedYes

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

Fingerprint

Dive into the research topics of 'Quadratically Constrained Quadratic Programs on Acyclic Graphs with Application to Power Flow'. Together they form a unique fingerprint.

Cite this