On the ergodic convergence rates of a first-order primal-dual algorithm.
Résumé
We revisit the proofs of convergence for a first order primal-dual algorithm for convex optimization which we have studied a few years ago. In particular, we prove rates of convergence for a more general version, with simpler proofs and more complete results.
Origine | Fichiers produits par l'(les) auteur(s) |
---|