On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (Q888313): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities |
scientific article |
Statements
On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (English)
0 references
30 October 2015
0 references
The paper presents theoretical results on the iteration complexity and convergence of a class of proximal-based decomposition methods for monotone variational inequalities. The authors prove that the \(\epsilon\)-optimality condition and relative error have \({\mathcal O }(1/t)\) iteration complexity.
0 references
variational inequality
0 references
proximal point algorithm
0 references
iteration complexity
0 references
relative error
0 references
convergence rate
0 references
error bound
0 references
