Sharpness, Restart and Acceleration - Laboratoire de mécanique et technologie Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Optimization Année : 2020

Sharpness, Restart and Acceleration

Résumé

The Łojasiewicz inequality shows that sharpness bounds on the minimum of convex optimization problems hold almost generically. Sharpness directly controls the performance of restart schemes, as observed by Nemirovskii and Nesterov [1985]. The constants quantifying these sharpness bounds are of course unobservable , but we show that optimal restart strategies are robust, in the sense that, in some important cases, finding the best restart scheme only requires a log scale grid search. Overall then, restart schemes generically accelerate accelerated first-order methods.
Fichier principal
Vignette du fichier
1702.03828.pdf (359.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02983236 , version 1 (29-10-2020)

Identifiants

Citer

Vincent Roulet, Alexandre d'Aspremont. Sharpness, Restart and Acceleration. SIAM Journal on Optimization, 2020, 30 (1), pp.262-289. ⟨10.1137/18M1224568⟩. ⟨hal-02983236⟩
2028 Consultations
158 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More