Clément Elvira

collaborators

Showing math.OCShow all

3 papers · 1 filter

math.OC2025

A Generic Branch-and-Bound Algorithm for $ℓ_{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…

math.OC2024

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…

math.OC2024

A New Branch-and-Bound Pruning Framework for $ℓ_{0}$ -Regularized Problems

We consider the resolution of learning problems involving $ℓ_{0}$ -regularization via Branch-and-Bound (BnB) algorithms. These methods explore regions of the feasible space of the…

A Generic Branch-and-Bound Algorithm for ℓ0​-Penalized Problems with Supplementary Material

One to beat them all: "RYU" -- a unifying framework for the construction of safe balls

A New Branch-and-Bound Pruning Framework for ℓ0​-Regularized Problems

A Generic Branch-and-Bound Algorithm for $ℓ_{0}$ -Penalized Problems with Supplementary Material

A New Branch-and-Bound Pruning Framework for $ℓ_{0}$ -Regularized Problems