Quelques contributions dans la conception de “régions sûres” et “tests d'élagages sûrs” en optimisation convexe
T Le Tran - 2023 - theses.hal.science
Convex optimization is common in machine learning, statistics, signal, and image
processing. Solving high-dimensional optimization problems remains challenging due to …
processing. Solving high-dimensional optimization problems remains challenging due to …
[PDF][PDF] Accelerated Sparse Signal Decomposition for Single-Step Estimation in Multistatic Radars and Sensor Networks
GM de Galland - 2023 - dial.uclouvain.be
With advancements in electronics and computer science, new research possibilities have
emerged, enabling the resolution of previously inaccessible complex problems. Multiple …
emerged, enabling the resolution of previously inaccessible complex problems. Multiple …
Safe Peeling for -Regularized Least-Squares
We introduce a new methodology dubbed “safe peeling” to accelerate the resolution of 0-
regularized least-squares problems via a Branch-and-Bound (BnB) algorithm. Our …
regularized least-squares problems via a Branch-and-Bound (BnB) algorithm. Our …