# Sébastien Le Digabel

Back## Cahiers du GERAD

### 58 results — page 2 of 3

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

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

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

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

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