58 citations · 145 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
Tight-and-cheap conic relaxation for the AC optimal power flow problem
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite, second-order cone, con…
Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne
Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilev…
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…
CONICOPF: Conic relaxations for AC optimal power flow computations
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
Computational speed and global optimality are key needs for practical algorithms for the optimal power flow problem. Two convex relaxations offer a favorable trade-off between the…