Abstract
This note proposes a novel approach to derive a worst-case O(1/k) convergence rate measured by the iteration complexity in a non-ergodic sense for the Douglas–Rachford alternating direction method of multipliers proposed by Glowinski and Marrocco.
Original language | English |
---|---|
Pages (from-to) | 567–577 |
Number of pages | 11 |
Journal | Numerische Mathematik |
Volume | 130 |
Issue number | 3 |
Early online date | 30 Nov 2014 |
DOIs | |
Publication status | Published - Jul 2015 |
Scopus Subject Areas
- Computational Mathematics
- Applied Mathematics