A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming

DOI10.1109/TCNS.2017.2774008OpenAlexW2770875486MaRDI QIDQ4630222

Abdulrahman Kalbat, Javad Lavaei, Ramtin Madani

Publication date: 29 March 2019

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcns.2017.2774008

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Related Items (3)

A survey on conic relaxations of optimal power flow problem ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ Unnamed Item

This page was built for publication: A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming