activity
20182022
most citedTight-and-cheap conic relaxation for the optimal reactive power dispatch problem

58 citations · 65 across the 3 of their papers we have counts for

collaborators

5 papers

math.OC2022★ 2 cited

A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables

Charles Audet, Edward Hallé-Hannan, Sébastien Le Digabel

A mathematical framework for modelling constrained mixed-variable optimization problems is presented in a blackbox optimization context. The framework introduces a new notation and…

math.OC2021

Use of static surrogates in hyperparameter optimization

Dounia Lakhmiri, Sébastien Le Digabel

Optimizing the hyperparameters and architecture of a neural network is a long yet necessary phase in the development of any new application. This consuming process can benefit from…

math.OC2020★ 5 cited

Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates

Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel

This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MADS) method originally de…

math.OC2019

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…

math.OC2018★ 58 cited

Tight-and-cheap conic relaxation for the optimal reactive power dispatch problem

Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel

The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, su…