Charles Audet
RetourCahiers du GERAD
137 résultats — page 2 de 7
A derivative-free approach to optimal control problems with a piecewise constant Mayer cost function
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
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with \(n=2^s\) vertices is not known when \(s \ge 3\). T...
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 BibTeXBlackbox optimization
The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...
référence BibTeX
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \(n=2^s\) vertices is not known when `(s ...
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
This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with the Cross-Entropy (CE) method for non smooth constrained optimizat...
référence BibTeX
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
The design of key nonlinear systems often requires the use of expensive blackbox simulations presenting inherent discontinuities whose positions in the varia...
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
The solution to a biobjective optimization problem is composed of a collection of trade-off solution called the Pareto set. The present work studies the que...
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
This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...
référence BibTeX
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
In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...
référence BibTeX
A small polygon is a polygon of unit diameter.
The question of finding the largest area of small \(n-\)gons
has been answered for some values of \(n\)....
Monotonic grey box optimization
We are interested in blackbox optimization for which the user is aware of monotonic behaviour of some constraints defining the problem. That is, when incr...
référence BibTeX
The present work is in a context of derivative-free optimization involving direct search algorithms guided by surrogate models of the original problem. The...
référence BibTeX
This is a two-part work. In Part I, low-cost and representative reduced-fidelity models of two versions of the HYDROTEL hydrological model are constructed, u...
référence BibTeXLow-cost and representative surrogate hydrological models. Part I - Construction of surrogates
Dealing with computationally-intensive calibration processes is still common in distributed hydrological modelling despite the computing power growth. Comput...
référence BibTeX