On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the ergodic convergence rates of a first-order primal-dual algorithm |
scientific article |
Statements
On the ergodic convergence rates of a first-order primal-dual algorithm (English)
0 references
16 September 2016
0 references
This paper displays refined ergodic convergence rates for a first-order primal-dual algorithm applied to composite convex-concave saddle-point problems. These new convergence rates are expressed in terms of the primal-dual gap function for accelerated variants of the algorithm. Several computational examples illustrate the performances of the proposed algorithms.
0 references
saddle-point preoblems
0 references
primal-dual algorithms
0 references
first order algorithms
0 references
convergence rates
0 references
ergodic convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
