Charles Audet

Back

Cahiers du GERAD

116 results — page 1 of 6

and

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

BibTeX reference
, , and

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

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that sh...

BibTeX reference
and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , , and

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

BibTeX reference
, , and

The design of key nonlinear systems often requires the use of expensive blackbox simulations presenting inherent discontinuities whose positions in the varia...

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
, , and

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

BibTeX reference

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
, , and

This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...

BibTeX reference
, , and

In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
and

The present work is in a context of derivative-free optimization involving direct search algorithms guided by surrogate models of the original problem. The...

BibTeX reference
, , , and

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

BibTeX reference
, , , and

Dealing with computationally-intensive calibration processes is still common in distributed hydrological modelling despite the computing power growth. Comput...

BibTeX reference
, , , , and

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

BibTeX reference