A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming

DOI10.1109/TCNS.2017.2774008MaRDI QIDQ4630222zbMATH OpenOpenAlexFDO

Authors Ramtin Madani, Abdulrahman Kalbat, Javad Lavaei

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)

Cited in

(4)

• A survey on conic relaxations of optimal power flow problem
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• scientific article; zbMATH DE number 7306888 (Why is no real title available?)
• On the robustness and scalability of semidefinite relaxation for optimal power flow problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630222)