An overview of semidefinite relaxations for optimal power flow problem

DOI10.1134/S0005117919050023zbMath1423.90202OpenAlexW2945689085WikidataQ127874166 ScholiaQ127874166MaRDI QIDQ2320274

Ivan A. Zorin, Elena N. Gryazina

Publication date: 22 August 2019

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117919050023

zbMATH Keywords

power systemssemidefinite programmingconvex relaxationspower flows

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Uses Software

• CVX
• MATPOWER
• pstca

Cites Work

• Positive definite completions of partial Hermitian matrices
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Minimal rank completions for block matrices
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Global Optimization with Polynomials and the Problem of Moments
• Equivalent Relaxations of Optimal Power Flow
• Exact Convex Relaxation of Optimal Power Flow in Radial Networks
• Semidefinite Programming
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• Convex Relaxation of Optimal Power Flow—Part II: Exactness
• Unnamed Item

This page was built for publication: An overview of semidefinite relaxations for optimal power flow problem