Extragradient methods for differential variational inequality problems and linear complementarity systems

2017 ◽  
Vol 40 (18) ◽  
pp. 7201-7217
Author(s):  
S. Z. Fatemi ◽  
M. Shamsi ◽  
Farid Bozorgnia
2021 ◽  
Author(s):  
D. R. Sahu

Abstract The main strategy of this paper is intended to speed up the convergence of the inertial Mann iterative method and further speed up it through the normal S-iterative method for a certain class of nonexpansive type operators that are linked with variational inequality problems. Our new convergence theory permits us to settle down the difficulty of unification of Korpelevich's extragradient method, Tseng's extragardient method, and subgardient extragardient method for solving variational inequality problems through an auxiliary algorithmic operator, which is associated with seed operator. The paper establishes an interesting fact that the relaxed inertial normal S-iterative extragradient methods do influence much more on convergence behaviour. Finally, the numerical experiments are carried out to illustrate that the relaxed inertial iterative methods, in particular the relaxed inertial normal S-iterative extragradient methods, may have a number of advantages over other methods in computing solutions of variational inequality problems in many cases.


Author(s):  
Konrawut Khammahawong ◽  
Poom Kumam ◽  
Parin Chaipunya ◽  
Somyot Plubtieng

AbstractWe propose Tseng’s extragradient methods for finding a solution of variational inequality problems associated with pseudomonotone vector fields in Hadamard manifolds. Under standard assumptions such as pseudomonotone and Lipschitz continuous vector fields, we prove that any sequence generated by the proposed methods converges to a solution of variational inequality problem, whenever it exits. Moreover, we give some numerical experiments to illustrate our main results.


Sign in / Sign up

Export Citation Format

Share Document