# Sébastien Le Digabel

Back## Publications

### Cahiers du GERAD

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

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...

BibTeX reference

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

BibTeX reference**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 p...

BibTeX referenceConstrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates

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

BibTeX reference

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

BibTeX reference**Sébastien Le Digabel**

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

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...

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

BibTeX reference

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

BibTeX referenceHyperNOMAD: Hyperparameter optimization of deep neural networks using mesh adaptive direct search

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...

BibTeX reference

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...

BibTeX reference

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...

BibTeX reference

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

BibTeX reference

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

BibTeX reference

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

BibTeX reference

Smart homes have the potential to achieve optimal energy consumption with appropriate scheduling. It is expected that 35% of households in North America an...

BibTeX reference

The parallel space decomposition of the Mesh Adaptive Direct Search algorithm (PSD-MADS proposed in 2008) is an asynchronous parallel method for constrained ...

BibTeX reference

We consider the maximum `\(k\)`

-cut problem that involves partitioning the vertex set of a graph into `\(k\)`

subsets such that the sum of the weights of the...

The mesh adaptive direct search (MADS) algorithm is designed for blackbox optimization problems for which the functions defining the objective and the constr...

BibTeX reference

We investigate surrogate-assisted strategies for global derivative-free optimization using the mesh adaptive direct search MADS blackbox optimization algorit...

BibTeX reference

The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite,...

BibTeX reference

Locally weighted regression combines the advantages of polynomial regression and kernel smoothing. We present three ideas for appropriate and effective use...

BibTeX reference

The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features i...

BibTeX referenceRobust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm

Blackbox optimization problems are often contaminated with numerical noise, and direct search methods such as the Mesh Adaptive Direct Search (MADS) algorit...

BibTeX reference

We present a new derivative-free trust-region (DFTR) algorithm to solve general nonlinear constrained problems with the use of an augmented Lagrangian m...

BibTeX reference

We study derivative-free constrained optimization problems and propose a trust-region method that builds linear or quadratic models around the best feasible ...

BibTeX reference**Sébastien Le Digabel**

An augmented Lagrangian (AL) can convert a constrained optimization problem into a sequence of simpler (e.g., unconstrained) problems, which are then usual...

BibTeX reference

We consider the maximum `\(k\)`

-cut problem that consists in partitioning the vertex set of a graph into `\(k\)`

subsets
such that the sum of the weights o...

Use of a biobjective direct search algorithm in the process design of material science applications

**Sébastien Le Digabel**

This work describes the application of a direct search method to the optimization of problems of real industrial interest, namely three new material scien...

BibTeX referenceNOMAD User Guide. Version 3.7.2

This document describes the NOMAD software, a C++ implementation of the Mesh Adaptive Direct Search (MADS) algorithm designed for constrained optimization of...

BibTeX reference**Sébastien Le Digabel**and Stefan M. Wild

The types of constraints encountered in black-box and simulation-based optimization problems differ significantly from those treated in nonlinear programmin...

BibTeX reference

Various constrained problem formulations for the optimization of an electro-thermal wing anti-icing system in both running-wet and evaporative regimes are pr...

BibTeX reference

The Mesh Adaptive Direct Search (MADS) algorithm is designed for blackbox optimization problems subject to general inequality constraints. Currently, MADS do...

BibTeX reference**Sébastien Le Digabel**, Herbert K.H. Lee, Pritam Ranjan, Garth Weels, and Stefan M. Wild

Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literatur...

BibTeX reference

Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer ...

BibTeX reference

Typical challenges of simulation-based design optimization include unavailable gradients and unreliable approximations thereof, expensive function evaluation...

BibTeX reference**Sébastien Le Digabel**

This work introduces the use of the treed Gaussian process (TGP) as a surrogate model within the mesh adaptive direct search (MADS) framework for constrain...

BibTeX reference

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

BibTeX reference**Sébastien Le Digabel**

We present ACRE, an Automatic aspeCt cREator, to use aspect-oriented programming to test multi-platform software programs written in C++. ACRE allows devel...

BibTeX referenceUse of quadratic models with mesh adaptive direct search for constrained black box optimization

**Sébastien Le Digabel**

We consider derivative-free optimization, and in particular black box optimization, where the functions to minimize and the functions representing the con...

BibTeX reference

Accurate measurements of snow water equivalent (SWE) is an important factor in managing water resources for hydroelectric power generation. SWE over a catchm...

BibTeX reference

During alloy and process design, it is often desired to identify regions of design or process variables for which certain calculated functions have optimal v...

BibTeX reference

The present paper describes the coupling of the Mesh Adaptive Direct Search (MADS) algorithm with the FactSage thermochemical software, which allows to calcu...

BibTeX reference

The paper proposes a framework for sensitivity analyses of blackbox constrained optimization problems for which Lagrange multipliers are not available. Two s...

BibTeX reference**Sébastien Le Digabel**

NOMAD is software that implements the MADS algorithm (Mesh Adaptive Direct Search) for black-box optimization under general nonlinear constraints. Black-box ...

BibTeX reference**Sébastien Le Digabel**

This work analyzes constrained black box optimization in which the functions defining the problem are periodic with respect to some or all the variables. We ...

BibTeX reference

<p>The class of Mesh Adaptive Direct Search (MADS) algorithms is designed for the optimization of constrained black-box problems. The purpose of this paper i...

BibTeX reference

We consider one of the most important issues for multinationals, the determination of transfer prices. To do so, we examine the example of a multinational co...

BibTeX reference

The purpose of this paper is to introduce a new way of choosing directions for the Mesh Adaptive Direct Search (MADS) class of algorithms. The advantages of...

BibTeX reference

This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern ...

BibTeX referenceNonsmooth Optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with th...

BibTeX reference

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

BibTeX reference

The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...

BibTeX reference### Articles

**Sébastien Le Digabel**and Stefan M. Wild

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, Viviane Rochon Montplaisir, and Christophe Tribes

**Sébastien Le Digabel**, and Renaud Saltet

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Ludovic Salomon

**Sébastien Le Digabel**, and Ludovic Salomon

**Sébastien Le Digabel**, and Christophe Tribes

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Andrea Lodi

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Christophe Tribes

**Sébastien Le Digabel**, and Jean-Philippe Harvey

**Sébastien Le Digabel**, and Mathilde Peyrega

**Sébastien Le Digabel**, and Bastien Talgorn

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Christophe Tribes

**Sébastien Le Digabel**, and Michael Kokkolaras

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Christophe Tribes

**Sébastien Le Digabel**, Herbert K.H. Lee, Pritam Ranjan, Garth Weels, and Stefan M. Wild

**Sébastien Le Digabel**, Herbert K.H. Lee, Pritam Ranjan, Garth Wells, and Stefan M. Wild

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Mathilde Peyrega

**Sébastien Le Digabel**, and Aïmen E. Gheribi

**Sébastien Le Digabel**, and Michael Kokkolaras

**Sébastien Le Digabel**, and James Merleau

**Sébastien Le Digabel**, and Christophe Tribes

**Sébastien Le Digabel**, Charles Audet, Joseph D Terwilliger, and Alejandro A Schäffer

**Sébastien Le Digabel**, Charles Audet, and Patrice Chartrand

**Sébastien Le Digabel**, and Louis-Alexandre Leclaire

**Sébastien Le Digabel**

**Sébastien Le Digabel**, Ève Bélisle, C.W. Bale, and Arthur D. Pelton

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, Charles Audet, and Arthur D. Pelton

**Sébastien Le Digabel**, and Nenad Mladenović

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Nenad Mladenović

### Book chapters

**Sébastien Le Digabel**

**Sébastien Le Digabel**, Amin Nawahda, and Jiang Zhong

**Sébastien Le Digabel**, and Michael Kokkolaras

**Sébastien Le Digabel**, Kenneth Diest, Luke A. Sweatlock, and Daniel E. Marthaler

**Sébastien Le Digabel**, and Yann-Gaël Guéhéneuc

**Sébastien Le Digabel**

### Proceedings

**Sébastien Le Digabel**, Ludovic Salomon, and Christophe Tribes

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**

**Sébastien Le Digabel**, and Michael Kokkolaras

**Sébastien Le Digabel**