In this work, we introduce new direct search schemes for the solution of bilevel optimization (BO) problems. Our methods rely on a fixed accuracy black box oracle for the lower-level problem, and deal both with smooth and potentially nonsmooth true objectives. We thus analyze for the first time in the literature direct search schemes in these settings, giving convergence guarantees to approximate stationary points, as well as complexity bounds in the smooth case. We also propose the first adaptation of mesh adaptive direct search schemes for BO. Some preliminary numerical results on a standard set of bilevel optimization problems show the effectiveness of our new approaches.
@article{arxiv.2307.09924,
title = {Inexact Direct-Search Methods for Bilevel Optimization Problems},
author = {Youssef Diouane and Vyacheslav Kungurtsev and Francesco Rinaldi and Damiano Zeffiro},
journal= {arXiv preprint arXiv:2307.09924},
year = {2023}
}