ISSN:
1573-2878
Keywords:
Mathematical programming
;
variational inequalities
;
projection methods
;
decomposition
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this paper, 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 Tseng (Ref. 1) and by Luo and Tseng (Ref. 2).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02192231
Permalink