In this work, we suggest and analyze an extragradient method for solving general nonconvex variational inequalities using the technique of the projection operator. We prove that the convergence of the extragradient method requires only pseudomonotonicity, which is a weaker condition than requiring m
Modified extragradient methods for solving variational inequalities
β Scribed by Abdellah Bnouhachem; M.H. Xu; Xiao-Ling Fu; Sheng Zhaohan
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 535 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we propose two methods for solving variational inequalities. In the first method, we modified the extragradient method by using a new step size while the second method can be viewed as an extension of the first one by performing an additional projection step at each iteration and another optimal step length is employed to reach substantial progress in each iteration. Under certain conditions, the global convergence of two methods is proved. Preliminary numerical experiments are included to illustrate the efficiency of the proposed methods.
π SIMILAR VOLUMES
In this paper, we suggest and analyze some new extragradient iterative methods for finding the common element of the fixed points of a nonexpansive mapping and the solution set of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. We also consider the strong conv