Convergence rates of the Heavy-Ball method for quasi-strongly convex optimization - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Convergence rates of the Heavy-Ball method for quasi-strongly convex optimization

Résumé

In this paper, we study the behavior of solutions of the ODE associated to the Heavy Ball method. Since the pioneering work of B.T. Polyak [25], it is well known that such a scheme is very efficient for C2 strongly convex functions with Lipschitz gradient. But much less is known when the C2 assumption is dropped. Depending on the geometry of the function to minimize, we obtain optimal convergence rates for the class of convex functions with some additional regularity such as quasi-strong convexity or strong convexity. We perform this analysis in continuous time for the ODE, and then we transpose these results for discrete optimization schemes. In particular, we propose a variant of the Heavy Ball algorithm which has the best state of the art convergence rate for first order methods to minimize strongly, composite non smooth convex functions.
Fichier principal
Vignette du fichier
HeavyBall_Fortement_convexe__version_longue_.pdf (718.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02545245 , version 1 (16-04-2020)
hal-02545245 , version 2 (02-03-2021)

Identifiants

  • HAL Id : hal-02545245 , version 2

Citer

Jean-François Aujol, Charles Dossal, Aude Rondepierre. Convergence rates of the Heavy-Ball method for quasi-strongly convex optimization. 2021. ⟨hal-02545245v2⟩
542 Consultations
1232 Téléchargements

Partager

Gmail Facebook X LinkedIn More