2 citations · 3 across the 5 of their papers we have counts for
6 papers
Optimization by Directional Attacks: Solving Problems with Neural Network Surrogates
Pierre-Yves Bouchet, Thibaut Vidal
This paper tackles optimization problems whose objective and constraints involve a trained Neural Network (NN), where the goal is to maximize subject to ,…
A Partitioned Optimization Framework for Structure-Aware Problems
Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin
This work tackles a class of optimization problems in which fixing some well-chosen combinations of the variables makes the problem substantially easier to solve. We consider that…
Convergence towards a local minimum by direct search methods with a covering step
Charles Audet, Pierre-Yves Bouchet. Loïc Bourdin
This paper introduces a new step to the Direct Search Method (DSM) to strengthen its convergence analysis. By design, this so-called covering step may ensure that for all refined p…
Erratum, counterexample and an additional revealing poll step for a result of "Analysis of direct searches for discontinuous functions''
Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin
This note provides a counterexample to a theorem announced in the last part of the paper ''Analysis of direct searches for discontinuous functions'', Mathematical Programming Vol.…
A derivative-free approach to optimal control problems with piecewise constant Mayer cost function
P. -Y. Bouchet, C. Audet, L. Bourdin
A piecewise constant Mayer cost function is used to model optimal control problems in which the state space is partitioned into several regions, each having its own Mayer cost valu…
Optimization of noisy blackboxes with adaptive precision
Stéphane Alarie, Charles Audet, Pierre-Yves Bouchet +1
In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It can be noisy, in the sens…