no code implementations • 31 Jul 2023 • Gilles Monnoyer, Thomas Feuillen, Maxime Drouguet, Laurent Jacques, Luc Vandendorpe
Our grid hopping approach, which relies on interpolation strategies, offers a reduced computation time while its performance stays on par with the direct method.
no code implementations • 28 Feb 2023 • Théo Guyard, Gilles Monnoyer, Clément Elvira, Cédric Herzet
We introduce a new methodology dubbed ``safe peeling'' to accelerate the resolution of L0-regularized least-squares problems via a Branch-and-Bound (BnB) algorithm.
