%0 Conference Paper %F Oral %T Branch-and-bound algorithm applied to sparse optimization problems: a study of some exploration strategies %+ Laboratoire des Sciences du Numérique de Nantes (LS2N) %+ École Centrale de Nantes (ECN) %+ Equipe Models and AlgoriThms for pRocessIng and eXtracting information (Lab-STICC_MATRIX) %+ École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne) %A Samain, Gwenael %A Ninin, Jordan %A Bourguignon, Sébastien %< avec comité de lecture %B EUROPT 2021, the 18th international workshop on continuous optimization %C Toulouse, France %8 2021-07-07 %D 2021 %Z Computer Science [cs]/Operations Research [cs.RO] %Z Mathematics [math]/Optimization and Control [math.OC] %Z Computer Science [cs]/Signal and Image ProcessingConference papers %X Sparse optimization focuses on finding a solution to least-squares problems with few non-zero components. Applications include inverse problems in signal processing, subset selection, or portfolio optimization. Optimization problems can be formulated as mixed-integer programs. A dedicated branchand-bound algorithm is able to exploit the specific structure of such problems and finds the global minimum much faster than generic MIP solvers. We will present some results about the fine-tuning process of this branch-and-bound algorithm, focusing mainly on the exploration strategy. %G English %L hal-03474817 %U https://hal.science/hal-03474817 %~ UNIV-BREST %~ UNIV-NANTES %~ INSTITUT-TELECOM %~ ENSTA-BRETAGNE %~ CNRS %~ UNIV-UBS %~ EC-NANTES %~ ENSTA-BRETAGNE-STIC %~ INSMI %~ UNAM %~ ENIB %~ LAB-STICC %~ TDS-MACS %~ LS2N %~ LS2N-SIMS %~ INSTITUTS-TELECOM %~ TEST-HALCNRS %~ LAB-STICC_MATRIX %~ LAB-STICC_DMID %~ NANTES-UNIVERSITE %~ UNIV-NANTES-AV2022 %~ NU-CENTRALE