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

DOI10.1109/TCNS.2015.2401172MaRDI QIDQ5358464zbMATH OpenFDO

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

Publication date 21 September 2017

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.5599

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Quadratic programming (90C20) Programming involving graphs or networks (90C35)

Abstract: This paper proves that non-convex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. When this condition is not satisfied, we propose a heuristic to obtain a feasible point. We demonstrate this approach on optimal power flow problems over radial networks.

Cited in

(17)

• Active network management for electrical distribution systems: problem formulation, benchmark, and approximate solution
• Graphical models for optimal power flow
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• A survey on conic relaxations of optimal power flow problem
• A distributed algorithm for high-dimension convex quadratically constrained quadratic programs
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
• Architecting a fully fuzzy information model for multi-level quadratically constrained quadratic programming problem
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• LP formulations for polynomial optimization problems
• A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• The convex hull of a quadratic constraint over a polytope
• An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
• Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
• Distributed dual subgradient methods with averaging and applications to grid optimization
• A second-order cone relaxation-based branch-and-bound algorithm for complex quadratic programs on acyclic graphs

This page was built for publication: Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358464)