En l’absence temporaire de gestionnaire dédiée au GdR IASIS, nous sommes malheureusement dans l’impossibilité d’assurer la prise en charge de missions (des membres du GdR souhaitant participer à cette journée) sur le budget du GdR.
Nous vous rappelons que, afin de garantir l'accès de tous les inscrits aux salles de réunion, l'inscription aux réunions est gratuite mais obligatoire.
7 personnes membres du GdR ISIS, et 2 personnes non membres du GdR, sont inscrits à cette réunion.
Capacité de la salle : 50 personnes.
Numerous problems in signal/image processing, statistics, and machine learning rely on the resolution of sparse optimization problems. These problems are very challenging to solve due to their combinatorial nature. The purpose of this thematic day is to bring together researchers in the field in order to explore the recent progress made in solving these challenging non-convex optimization problems. In particular, the program will cover a variety of methods from continuous relaxation and non-convex optimization algorithms to global optimization techniques.
L. Calatroni (CNRS, Laboratoire I3S), E. Soubies (CNRS, IRIT)
The day will start with a joint talk by Laure Blanc-Féraud and Jérôme Idier on a historical overview of $\ell_0$ minimisation approaches. The program will then be divided into three main sessions: continuous relaxations, nonconvex algorithms, and global optimization, each of which will start with a talk given by a an invited speaker.
Laure Blanc-Féraud (CNRS)
Sébastien Bourguignon (École Centrale de Nantes)
Marcus Carlsson (Lund University, Sweden)
Jérôme Idier (CNRS)
Alain Rakotomamonjy (Criteo AI labs & Université de Rouen)
We encourage the submission of talks on the topics of the event. Please send your proposals (title + short abstract) using the submission form:
https://forms.gle/67c1nnCGgXGK4r8r5
Registration is free but mandatory for organization purposes and maximal room capacity.
