15 citations · 45 across the 14 of their papers we have counts for
4 papers · 1 filter
A Generic Branch-and-Bound Algorithm for -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…
A New Branch-and-Bound Pruning Framework for -Regularized Problems
Theo Guyard, Cédric Herzet, Clément Elvira +1
We consider the resolution of learning problems involving -regularization via Branch-and-Bound (BnB) algorithms. These methods explore regions of the feasible space of the…
One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
Thu-Le Tran, Clément Elvira, Hong-Phuong Dang +1
In this paper, we present a new framework, called "RYU" for constructing "safe" regions -- specifically, bounded sets that are guaranteed to contain the dual solution of a target o…
Screen & Relax: Accelerating the resolution of Elastic-net by safe identification of the solution support
Théo Guyard, Cédric Herzet, Clément Elvira
In this paper, we propose a procedure to accelerate the resolution of the well-known "Elastic-Net" problem. Our procedure is based on the (partial) identification of the solution s…