Inertial projection-type methods for solving pseudomonotone variational inequality problems in Hilbert space

Author(s):  
Simeon Reich ◽  
Duong Viet Thong ◽  
Prasit Cholamjiak ◽  
Luong Van Long
Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 127
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo

A number of applications from mathematical programmings, such as minimization problems, variational inequality problems and fixed point problems, can be written as equilibrium problems. Most of the schemes being used to solve this problem involve iterative methods, and for that reason, in this paper, we introduce a modified iterative method to solve equilibrium problems in real Hilbert space. This method can be seen as a modification of the paper titled “A new two-step proximal algorithm of solving the problem of equilibrium programming” by Lyashko et al. (Optimization and its applications in control and data sciences, Springer book pp. 315–325, 2016). A weak convergence result has been proven by considering the mild conditions on the cost bifunction. We have given the application of our results to solve variational inequality problems. A detailed numerical study on the Nash–Cournot electricity equilibrium model and other test problems is considered to verify the convergence result and its performance.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xueyong Wang ◽  
Shengjie Li ◽  
Xipeng Kou

An extension of subgradient method for solving variational inequality problems is presented. A new iterative process, which relates to the fixed point of a nonexpansive mapping and the current iterative point, is generated. A weak convergence theorem is obtained for three sequences generated by the iterative process under some mild conditions.


Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 462
Author(s):  
Apichit Buakird ◽  
Nimit Nimana ◽  
Narin Petrot

We propose a modified extragradient method for solving the variational inequality problem in a Hilbert space. The method is a combination of the well-known subgradient extragradient with the Mann’s mean value method in which the updated iterate is picked in the convex hull of all previous iterates. We show weak convergence of the mean value iterate to a solution of the variational inequality problem, provided that a condition on the corresponding averaging matrix is fulfilled. Some numerical experiments are given to show the effectiveness of the obtained theoretical result.


Sign in / Sign up

Export Citation Format

Share Document