Charles Audet

Retour

Cahiers du GERAD

134 résultats — page 1 de 7

Solving optimization problems in which functions are blackboxes and variables involve different types poses significant theoretical and algorithmic challeng...

référence BibTeX

Benchmarking new optimization methods on test problems is essential for assessing their performance and tuning their parameters. Yet, few problems are avail...

référence BibTeX
, et

Benchmarking is essential for assessing the effectiveness of optimization algorithms. This is especially true in derivative-free optimization, where target ...

référence BibTeX

Researchers around the globe attend the International Symposium on Mathematical Programming (ISMP) to share their latest results in mathematics, algorithms, ...

référence BibTeX
, et

Bistable mechanical systems exhibit two stable configurations where the elastic energy is locally minimized. To realize such systems, origami techniques ha...

référence BibTeX
, et

This work introduces a _partitioned optimization framework_ (POf) to ease the solving process for optimization problems for which fixing some variables to a...

référence BibTeX
, et

Cet article propose une nouvelle étape à ajouter à chaque itération de la Méthode de Recherche Directe Direct Search Method (DSM) en anglais) pour renfor...

référence BibTeX
, , , , , , et

This work introduces solar, a collection of ten optimization problem instances for benchmarking blackbox optimization solvers. The instances present differ...

référence BibTeX

Heterogeneous datasets emerge in various machine learning or optimization applications that feature different data sources, various data types and complex re...

référence BibTeX
, et

The cosine measure was introduced in 2003 to quantify the richness of a finite positive spanning sets of directions in the context of derivative-free direc...

référence BibTeX
, , , 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

This paper addresses risk averse constrained optimization problems where the objective and constraint functions can only be computed by a blackbox subject to...

référence BibTeX
, , et

This work considers stochastic optimization problems in which the objective function values can only be computed by a blackbox corrupted by some random noise...

référence BibTeX
, et

Cette note fournit un contre-exemple à un théorème proposé dans la dernière partie de l'article Analysis of direct searches for discontinuous functions, Ma...

référence BibTeX

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

Engineering design is often faced with uncertainties, making it difficult to determine an optimal design. In an unconstrained context, this amounts to choose...

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

Une fonction de coût de Mayer constante par morceaux est requise pour correctement modéliser des problèmes de contrôle optimal dans lesquels l'espace des éta...

référence BibTeX
et

A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with n=2s vertices is not known when s3. T...

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