Convex Relaxation of Optimal Power Flow—Part II: Exactness
From MaRDI portal
Abstract: This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.
Cited in
(33)- 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
- Graphical models for optimal power flow
- Convexification of generalized network flow problem
- Modeling and simulation of sector-coupled energy networks: a gas-power benchmark
- A survey on conic relaxations of optimal power flow problem
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- An overview of semidefinite relaxations for optimal power flow problem
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- Strong SOCP relaxations for the optimal power flow problem
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- A Theory of Solvability for Lossless Power Flow Equations—Part I: Fixed-Point Power Flow
- Generalized Convex Hull Pricing for the AC Optimal Power Flow Problem
- Robust Optimization for Electricity Generation
- A fluid model of an electric vehicle charging network
- Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning
- Critical behaviour in charging of electric vehicles
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- Efficient simulation of coupled gas and power networks under uncertain demands
- Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
- New semidefinite relaxations for a class of complex quadratic programming problems
- 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
- A reverse Stackelberg model for demand response in local energy markets
- Reduction of losses in electric power distribution system-dynamic reconfiguration case study
- Stochastic dual dynamic programming for optimal power flow problems under uncertainty
- Efficient bounds tightening based on SOCP relaxations for AC optimal power flow
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
This page was built for publication: Convex Relaxation of Optimal Power Flow—Part II: Exactness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358416)
