Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
From MaRDI portal
Publication:5358402
DOI10.1109/TCNS.2014.2309732zbMath1370.90043arXiv1405.0766OpenAlexW3097981256WikidataQ56813570 ScholiaQ56813570MaRDI QIDQ5358402
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.0766
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10)
Related Items (35)
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 ⋮ Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty ⋮ A Fluid Model of an Electric Vehicle Charging Network ⋮ Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning ⋮ A Riemannian optimization approach to the radial distribution network load flow problem ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ 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 ⋮ Asymptotic analysis of Emden-Fowler type equation with an application to power flow models ⋮ A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems ⋮ Comparison of stability regions for a line distribution network with stochastic load demands ⋮ 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 ⋮ A distributed continuous-time method for non-convex QCQPs ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ Modeling and simulation of sector-coupled energy networks: a gas-power benchmark ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Convexity/Nonconvexity Certificates for Power Flow Analysis ⋮ 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 ⋮ A complementarity model for electric power transmission-distribution coordination under uncertainty ⋮ Robust Optimization for Electricity Generation ⋮ TRIPODS/MOPTA 2018 special issue on energy and optimization ⋮ 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 ⋮ Electrical flows over spanning trees ⋮ Flow and Elastic Networks on the 𝑛-Torus: Geometry, Analysis, and Computation ⋮ A Large-Deviation-Based Splitting Estimation of Power Flow Reliability ⋮ 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 I: Formulations and Equivalence
