8 papers
Adaptive direct search algorithms with relaxable and quantifiable constraints
Charles Audet, Théo Denorme, Youssef Diouane +2
This work introduces ADS-PB, an extension of the Adaptive Direct Search (ADS) framework for solving constrained blackbox optimization problems. With ADS, iterates progress without…
Benchmarking Bilevel Derivative-Free Optimization Algorithms
Charles Audet, Valentin Dijon, Youssef Diouane
Bilevel optimization involves an upper-level and a lower-level decision maker. The lower-level optimization problem is nested within the constraints of the upper-level one. A point…
Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
Charles Audet, Youssef Diouane, Edward Hallé-Hannan +2
In simulation-based engineering, design choices are often obtained following the optimization of complex blackbox models. These models frequently involve mixed-variable domains wit…
A penalty-interior point method combined with MADS for equality and inequality constrained optimization
Charles Audet, Andrea Brilli, Youssef Diouane +3
This work introduces MADS-PIP, an efficient framework that integrates a penalty-interior point strategy into the mesh adaptive direct search (MADS) algorithm for solving nonsmooth…
Multi-fidelity constraints in blackbox optimization
Stéphane Alarie, Charles Audet, Miguel Diago +2
This work studies constrained blackbox optimization problems that cannot be solved in reasonable time due to prohibitive computational costs. This challenge is especially prevalent…
Adaptive direct search algorithms for constrained optimization
Charles Audet, Théo Denorme, Youssef Diouane +2
Two families of directional direct search methods have emerged in derivative-free and blackbox optimization (DFO and BBO), each based on distinct principles: Mesh Adaptive Direct S…