Sébastien Le Digabel

Retour

Cahiers du GERAD

59 résultats — page 1 de 3

, , , et

This work introduces a novel multi-fidelity blackbox optimization algorithm designed to alleviate the resource-intensive task of evaluating infeasible points...

référence BibTeX
, et

A mathematical framework for modelling constrained mixed-variable optimization problems is presented in a blackbox optimization context. The framework intr...

référence BibTeX
, et

This work proposes the integration of two new constraint-handling approaches into the blackbox constrained multiobjective optimization algorithm DMulti-MADS,...

référence BibTeX
, , et

In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...

référence BibTeX
, et

This work is in the context of blackbox optimization where the functions defining the problem are expensive to evaluate and where no derivatives are availabl...

référence BibTeX
, , et

NOMAD is software for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic...

référence BibTeX
et

Optimizing the hyperparameters and architecture of a neural network is a long yet necessary phase in the development of any new application. This consuming p...

référence BibTeX
, et

This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MAD...

référence BibTeX
, , , et

This work reviews blackbox optimization applications over the last twenty years, addressed using direct search optimization methods. Emphasis is placed on...

référence BibTeX
, et

The Mars Curiosity rover is frequently sending back engineering and science data that goes through a pipeline of systems before reaching its final destinati...

référence BibTeX

Artificial Intelligence (AI) is the next society transformation builder. Massive AI-based applications include cloud servers, cell phones, cars, and pandemic...

référence BibTeX
, et

The context of this research is multiobjective optimization where conflicting objectives are present. In this work, these objectives are only available as th...

référence BibTeX
, et

This work considers the graph partitioning problem known as maximum k-cut. It focuses on investigating features of a branch-and-bound method to efficiently...

référence BibTeX

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

référence BibTeX
, , et

This work introduces StoMADS, a stochastic variant of the mesh adaptive direct-search (MADS) algorithm originally developed for deterministic blackbox optim...

référence BibTeX
, et

The performance of deep neural networks is highly sensitive to the choice of the hyperparameters that define the structure of the network and the learning pr...

référence BibTeX
, et

Computational speed and global optimality are a key need for pratical algorithms of the OPF problem. Recently, we proposed a tight-and-cheap conic relaxation...

référence BibTeX
, et

In demand-response programs, aggregators balance the needs of generation companies and end-users. This work proposes a two-phase framework that shaves the ag...

référence BibTeX
, et

Smart homes have the potential to achieve efficient energy consumption: households can profit from appropriately scheduled consumption. By 2020, 35% of all h...

référence BibTeX
, , , et

In the recent years, the development of new algorithms for multiobjective optimization has considerably grown. A large number of performance indicators has...

référence BibTeX