Théo Guyard

CoRR, June, 2025

A Generic Branch-and-Bound Algorithm for ℓ<sub>0</sub>-Penalized Problems with Supplementary Material.

[BibT_eX]

[DOI]

CoRR, June, 2025

2024

Branch-and-Bound Algorithms for L0-Regularized Problems. (Algorithmes de Branch-and-Bound pour les Problèmes avec Régularisation L0).

[BibT_eX]

[DOI]

PhD thesis, 2024

A New Branch-and-Bound Pruning Framework for ℓ<sub>0</sub>-Regularized Problems.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Safe peeling for l0-regularized least-squares with supplementary material.

[BibT_eX]

[DOI]

CoRR, 2023

Safe Peeling for $\ell_{0}$-Regularized Least-Squares.

[BibT_eX]

[DOI]

Proceedings of the 31st European Signal Processing Conference, 2023

2022

Node-Screening Tests For The L0-Penalized Least-Squares Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2022

Screen & Relax: Accelerating The Resolution Of Elastic-Net By Safe Identification of The Solution Support.

[BibT_eX]

[DOI]