A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow

DOI10.1080/10556788.2017.1288729zbMath1382.90073arXiv1506.08568OpenAlexW2268876679MaRDI QIDQ4594836

Martin Takáč, Jakub Mareček

Publication date: 24 November 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08568

zbMATH Keywords

optimizationsemidefinite programmingpower system analysis

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Related Items (3)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ A strengthened Barvinok-Pataki bound on SDP rank ⋮ A survey on conic relaxations of optimal power flow problem

This page was built for publication: A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow