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

Ieee Steven H. Low Fellow,F. I. K. Mani Chandy,S. Bose

Published 2012 in IEEE Transactions on Control of Network Systems

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.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-77 of 77 references · Page 1 of 1

CITED BY

Showing 1-100 of 133 citing papers · Page 1 of 2