On the robustness and scalability of semidefinite relaxation for optimal power flow problems
From MaRDI portal
(Redirected from Publication:779755)
Abstract: Semidefinite relaxation techniques have shown great promise for nonconvex optimal power flow problems. However, a number of independent numerical experiments have led to concerns about scalability and robustness of existing SDP solvers. To address these concerns, we investigate some numerical aspects of the problem and compare different state-of-the-art solvers. Our results demonstrate that semidefinite relaxations of large problem instances with on the order of 10,000 buses can be solved reliably and to reasonable accuracy within minutes. Furthermore, the semidefinite relaxation of a test case with 25,000 buses can be solved reliably within half an hour; the largest test case with 82,000 buses is solved within eight hours. We also compare the lower bound obtained via semidefinite relaxation to locally optimal solutions obtained with nonlinear optimization methods and calculate the optimality gap.
Recommendations
- An overview of semidefinite relaxations for optimal power flow problem
- Strong SOCP relaxations for the optimal power flow problem
- Global optimization for optimal power flow over transmission networks
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- On the r-uniform linear hypertrees with extremal Estrada indices
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
- An independent benchmarking of SDP and SOCP solvers
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Graph implementations for nonsmooth convex programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Strong SOCP relaxations for the optimal power flow problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(12)- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Global optimization for optimal power flow over transmission networks
- TRIPODS/MOPTA 2018 special issue on energy and optimization
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- An overview of semidefinite relaxations for optimal power flow problem
- Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- A semismooth Newton method for solving optimal power flow
- Bregman primal-dual first-order method and application to sparse semidefinite programming
Describes a project that uses
Uses Software
This page was built for publication: On the robustness and scalability of semidefinite relaxation for optimal power flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779755)
