Quadratically constrained quadratic programs on acyclic graphs with application to power flow

Details Quadratically constrained quadratic programs on acyclic graphs with application to power flow Quadratically constrained quadratic programs on acyclic graphs with application to power flow

2012-03-26

arxiv.org/abs/1203.5599v1

Mathematics

Optimization and Control

22 pages, 1 figure. A special case for optimal power flow problem was published earlier in 49th Annual Allerton Conference on

Scientific paper

This paper proves that non-convex quadratically constrained quadratic programs have an exact semidefinite relaxation when their underlying graph is acyclic, provided the constraint set satisfies a certain technical condition. When the condition is not satisfied, we propose a heuristic to obtain a feasible point starting from a solution of the relaxed problem. These methods are then demonstrated to provide exact solutions to a richer class of optimal power flow problems than previously solved.

Affiliated with

Also associated with

No associations

Rating

Quadratically constrained quadratic programs on acyclic graphs with application to power flow does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quadratically constrained quadratic programs on acyclic graphs with application to power flow, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quadratically constrained quadratic programs on acyclic graphs with application to power flow will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640025