Computational analysis of sparsity-exploiting moment relaxations of the OPF problem
Computational analysis of sparsity-exploiting moment relaxations of the OPF problem
With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, "moment-based" relaxations from the Lasserre hierarchy for polynomial optimization have been shown capable of globally solving a broad class of OPF problems. Global solution of many large-scale test cases …