Abstract
We consider combining the generalized alternating direction method of multipliers, proposed by Eckstein and Bertsekas, with the logarithmic–quadratic proximal method proposed by Auslender, Teboulle, and Ben-Tiba for solving a variational inequality with separable structures. For the derived algorithm, we prove its global convergence and establish its worst-case convergence rate measured by the iteration complexity in both the ergodic and nonergodic senses.
Original language | English |
---|---|
Pages (from-to) | 218-233 |
Number of pages | 16 |
Journal | Journal of Optimization Theory and Applications |
Volume | 164 |
Issue number | 1 |
Early online date | 13 May 2014 |
DOIs | |
Publication status | Published - Jan 2015 |
Scopus Subject Areas
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics
User-Defined Keywords
- Convergence rate
- Generalized alternating direction method of multipliers
- Logarithmic–quadratic proximal method
- Variational inequality