3 papers
cs.RO2021
A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems
Julie Sliwak, Miguel Anjos, Lucas Létocart +1
The Reactive Optimal Power Flow (ROPF) problem consists in computing an optimal power generation dispatch for an alternating current transmission network that respects power flow e…
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.OC2017
A simplicial decomposition framework for large scale convex quadratic programming
Enrico Bettiol, Lucas Létocart, Francesco Rinaldi +1
In this paper, we analyze in depth a simplicial decomposition like algorithmic framework for large scale convex quadratic programming. In particular, we first propose two tailored…