On the robustness and scalability of semidefinite relaxation for optimal power flow problems
From MaRDI portal
Publication:779755
DOI10.1007/s11081-019-09427-4zbMath1447.90069arXiv1806.08620OpenAlexW2950122300WikidataQ128264532 ScholiaQ128264532MaRDI QIDQ779755
Joachim Dahl, Anders Eltved, Martin S. Andersen
Publication date: 14 July 2020
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.08620
Related Items
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Bregman primal-dual first-order method and application to sparse semidefinite programming, TRIPODS/MOPTA 2018 special issue on energy and optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- An independent benchmarking of SDP and SOCP solvers
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Graph Implementations for Nonsmooth Convex Programs
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
