On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (Q888313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s40305-015-0086-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W882599302 / rank | |||
Normal rank | |||
Revision as of 19:56, 19 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
