scholarly journals An Efficient Parallel Extragradient Method for Systems of Variational Inequalities Involving Fixed Points of Demicontractive Mappings

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1915
Author(s):  
Lateef Olakunle Jolaoso ◽  
Maggie Aphane
Keyword(s):  
Variational Inequalities ◽  
Hilbert Spaces ◽  
Line Search ◽  
Convex Combination ◽  
Extragradient Method ◽  
Convergence Result ◽  
Armijo Line Search ◽  
Systems Of Variational Inequalities ◽  
Demicontractive Mappings ◽  
The Cost

Herein, we present a new parallel extragradient method for solving systems of variational inequalities and common fixed point problems for demicontractive mappings in real Hilbert spaces. The algorithm determines the next iterate by computing a computationally inexpensive projection onto a sub-level set which is constructed using a convex combination of finite functions and an Armijo line-search procedure. A strong convergence result is proved without the need for the assumption of Lipschitz continuity on the cost operators of the variational inequalities. Finally, some numerical experiments are performed to illustrate the performance of the proposed method.

scholarly journals Parallel Tseng’s Extragradient Methods for Solving Systems of Variational Inequalities on Hadamard Manifolds

Symmetry ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 43
Author(s):  
Lu-Chuan Ceng ◽  
Yekini Shehu ◽  
Yuanheng Wang
Keyword(s):  
Variational Inequalities ◽  
Parallel Algorithms ◽  
Line Search ◽  
Vector Fields ◽  
Hadamard Manifolds ◽  
Monotone Variational Inequalities ◽  
Extragradient Methods ◽  
Lipschitz Constants ◽  
Systems Of Variational Inequalities

The aim of this article is to study two efficient parallel algorithms for obtaining a solution to a system of monotone variational inequalities (SVI) on Hadamard manifolds. The parallel algorithms are inspired by Tseng’s extragradient techniques with new step sizes, which are established without the knowledge of the Lipschitz constants of the operators and line-search. Under the monotonicity assumptions regarding the underlying vector fields, one proves that the sequences generated by the methods converge to a solution of the monotone SVI whenever it exists.

A new self adaptive Tseng’s extragradient method with double-projection for solving pseudomonotone variational inequality problems in Hilbert spaces

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Zhongbing Xie ◽  
Gang Cai ◽  
Xiaoxiao Li ◽  
Qiao-Li Dong
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Strong Convergence ◽  
Hilbert Spaces ◽  
Convergence Theorem ◽  
Numerical Experiments ◽  
Extragradient Method ◽  
Variational Inequality Problems ◽  
Strong Convergence Theorem ◽  
Tseng’S Extragradient Method

Abstract The purpose of this paper is to study a new Tseng’s extragradient method with two different stepsize rules for solving pseudomonotone variational inequalities in real Hilbert spaces. We prove a strong convergence theorem of the proposed algorithm under some suitable conditions imposed on the parameters. Moreover, we also give some numerical experiments to demonstrate the performance of our algorithm.

scholarly journals Approximation Results for Variational Inequalities Involving Pseudomonotone Bifunction in Real Hilbert Spaces

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 182
Author(s):  
Kanikar Muangchoo ◽  
Nasser Aedh Alreshidi ◽  
Ioannis K. Argyros
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Hilbert Spaces ◽  
Optimization Problems ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Mathematical Problem ◽  
Lipschitz Constant ◽  
Step Size ◽  
Pseudomonotone Bifunction

In this paper, we introduce two novel extragradient-like methods to solve variational inequalities in a real Hilbert space. The variational inequality problem is a general mathematical problem in the sense that it unifies several mathematical models, such as optimization problems, Nash equilibrium models, fixed point problems, and saddle point problems. The designed methods are analogous to the two-step extragradient method that is used to solve variational inequality problems in real Hilbert spaces that have been previously established. The proposed iterative methods use a specific type of step size rule based on local operator information rather than its Lipschitz constant or any other line search procedure. Under mild conditions, such as the Lipschitz continuity and monotonicity of a bi-function (including pseudo-monotonicity), strong convergence results of the described methods are established. Finally, we provide many numerical experiments to demonstrate the performance and superiority of the designed methods.

scholarly journals Halpern subgradient extragradient algorithm for solving quasimonotone variational inequality problems

2021 ◽  
Vol 38 (1) ◽  
pp. 249-262
Author(s):  
PONGSAKORN YOTKAEW ◽  
◽  
HABIB UR REHMAN ◽  
BANCHA PANYANAK ◽  
NUTTAPOL PAKKARANANG ◽  
...  
Keyword(s):  
Variational Inequalities ◽  
Hilbert Spaces ◽  
Line Search ◽  
Lipschitz Constant ◽  
Iterative Sequence ◽  
Step Size ◽  
Infinite Dimensional ◽  
Extragradient Algorithm ◽  
Line Search Method ◽  
Quasimonotone Operators

In this paper, we study the numerical solution of the variational inequalities involving quasimonotone operators in infinite-dimensional Hilbert spaces. We prove that the iterative sequence generated by the proposed algorithm for the solution of quasimonotone variational inequalities converges strongly to a solution. The main advantage of the proposed iterative schemes is that it uses a monotone and non-monotone step size rule based on operator knowledge rather than its Lipschitz constant or some other line search method.

scholarly journals A New Iterative Algorithm for Pseudomonotone Equilibrium Problem and a Finite Family of Demicontractive Mappings

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
F. U. Ogbuisi ◽  
F. O. Isiogugu
Keyword(s):  
Hilbert Space ◽  
Iterative Method ◽  
Equilibrium Problem ◽  
Numerical Experiments ◽  
Real Hilbert Space ◽  
Convex Combination ◽  
Convergence Result ◽  
Finite Family ◽  
Demicontractive Mappings ◽  
New Iterative Method

In this paper, we introduce a new iterative method in a real Hilbert space for approximating a point in the solution set of a pseudomonotone equilibrium problem which is a common fixed point of a finite family of demicontractive mappings. Our result does not require that we impose the condition that the sum of the control sequences used in the finite convex combination is equal to 1. Furthermore, we state and prove a strong convergence result and give some numerical experiments to demonstrate the efficiency and applicability of our iterative method.

Sign in / Sign up

Export Citation Format

Share Document