On the convergence of projection methods: Application to the decomposition of affine variational inequalities (Q1897456)
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 790570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence of projection methods: Application to the decomposition of affine variational inequalities |
scientific article; zbMATH DE number 790570 |
Statements
On the convergence of projection methods: Application to the decomposition of affine variational inequalities (English)
0 references
27 August 1995
0 references
We first discuss the global convergence of symmetric projection methods for solving nonlinear monotone variational inequalities under a cocoercivity assumption. A similar analysis is applied to asymmetric projection methods, when the mapping is affine and monotone. Under a suitable choice of the projection matrix, decomposition can be achieved. It is proved that this scheme achieves a linear convergence rate, thus enhancing results previously obtained by \textit{P. Tseng} [SIAM J. Control Optimization 29, No. 1, 119-138 (1991; Zbl 0737.90048)] and \textit{Z.-Q. Luo} and \textit{P. Tseng} [SIAM J. Optim. 2, No. 1, 43-54 (1992; Zbl 0777.49010)].
0 references
global convergence of symmetric projection methods
0 references
nonlinear monotone variational inequalities
0 references
cocoercivity assumption
0 references
0 references
0 references
0 references
0.8445374965667725
0 references
0.8241363763809204
0 references
0.8175880312919617
0 references
0.8173922300338745
0 references
