5 citations · 8 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems
Julie Sliwak, Miguel Anjos, Lucas Létocart +2
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, w…
math.OC2019
A Julia Module for Polynomial Optimization with Complex Variables applied to Optimal Power Flow
Julie Sliwak, Manuel Ruiz, Miguel F. Anjos +2
Many optimization problems in power transmission networks can be formulated as polynomial problems with complex variables. A polynomial optimization problem with complex variables…