Convex Relaxation of Optimal Power Flow—Part II: Exactness

DOI10.1109/TCNS.2014.2323634zbMath1370.90044arXiv1405.0814OpenAlexW3098546508WikidataQ56813571 ScholiaQ56813571MaRDI QIDQ5358416

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/1405.0814

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10)

Related Items (22)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Globally solving a class of optimal power flow problems in radial networks by tree reduction ⋮ A Fluid Model of an Electric Vehicle Charging Network ⋮ Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning ⋮ Efficient simulation of coupled gas and power networks under uncertain demands ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Strong SOCP Relaxations for the Optimal Power Flow Problem ⋮ New semidefinite relaxations for a class of complex quadratic programming problems ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ Graphical models for optimal power flow ⋮ Convexification of generalized network flow problem ⋮ Critical behaviour in charging of electric vehicles ⋮ Modeling and simulation of sector-coupled energy networks: a gas-power benchmark ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ An overview of semidefinite relaxations for optimal power flow problem ⋮ Robust Optimization for Electricity Generation ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems ⋮ A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

This page was built for publication: Convex Relaxation of Optimal Power Flow—Part II: Exactness