Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization

Résumé

We propose two acceleration techniques for sparse optimization (the minimization of a cardinality-penalized least-squares function) with branch-and-bound algorithms. Convex duality is applied to the relaxation problems at each node of the search tree, allowing one to early prune suboptimal nodes thanks to the computation of valid dual bounds. Then, screening methods are implemented during each node evaluation, which reduce the problem size by fixing variables to their optimal value. Numerical experiments study the efficiency of such techniques as a function of the problem difficulty.
Fichier non déposé

Dates et versions

hal-03781296 , version 1 (20-09-2022)

Identifiants

  • HAL Id : hal-03781296 , version 1

Citer

Gwenaël Samain, Sébastien Bourguignon, Jordan Ninin. Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization. EUROPT 19th Workshop on Advances in Continuous Optimization, Jul 2022, Lisbonne, Portugal. ⟨hal-03781296⟩
29 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More