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

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

Derivative-free optimization (DFO) is the mathematical study of the optimization algorithms that do not use derivatives. One branch of DFO focuses on model-...

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

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

Despite the lack of theoretical and practical convergence support, the Nelder-Mead (NM) algorithm is widely used to solve unconstrained optimization proble...

The calibration of hydrological models is here formulated as a Blackbox optimization problem where the only information available to the optimization algorit...

The Runge-Kutta class of iterative methods is designed to approximate solutions of a system of ordinary differential equations (ODE). The second-order cla...

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

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

Les problèmes d'optimisation de boîtes noires sont souvent contaminés par du bruit numérique, et les méthodes de recherche directe telles que l'algorithme de...

The authors investigate the complexity needed in the structure of the scenario trees to maximize energy production in a rolling-horizon framework. Three comp...

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

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

This paper presents an optimization method to solve the short-term unit commitment and loading problem with uncertain inflows. A scenario tree is built base...

The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, part...

Ce travail montre que parmi tous les polygones équilatéraux convexes avec le même nombre de côtés et le même diamètre, le polygone régulier possède l'aire ma...

Ce document décrit le logiciel NOMAD, une implémentation C++ de l'algorithme de recherche directe sur treillis adaptifs (Mads) pour l'optimisation sous cont...

In prior works, this group demonstrated the feasibility of valid adaptive sequential designs for crossover bioequivalence studies. In this paper, we extend t...

We study the function returning the sum of the k components of largest magnitude of a vector. We show that if a nonnegative vector x is such that its Eu...