On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (Q888313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6502467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities |
scientific article; zbMATH DE number 6502467 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8288963437080383
0 references
0.8193790912628174
0 references
0.8046343922615051
0 references
