A Generic Branch-and-Bound Algorithm for ${\ell }_0$-Penalized Problems with Supplementary Material

Clément Elvira, Théo Guyard, Cédric Herzet

We present a generic Branch-and-Bound procedure designed to solve L0-penalized optimization problems. Existing approaches primarily focus on quadratic losses and construct relaxati…