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

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.

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1496
Author(s):  
Chun-Yan Wang ◽  
Lu-Chuan Ceng ◽  
Long He ◽  
Hui-Ying Hu ◽  
Tu-Yan Zhao ◽  
...  

In a Hadamard manifold, let the VIP and SVI represent a variational inequality problem and a system of variational inequalities, respectively, where the SVI consists of two variational inequalities which are of symmetric structure mutually. This article designs two parallel algorithms to solve the SVI via the subgradient extragradient approach, where each algorithm consists of two parts which are of symmetric structure mutually. It is proven that, if the underlying vector fields are of monotonicity, then the sequences constructed by these algorithms converge to a solution of the SVI. We also discuss applications of these algorithms for approximating solutions to the VIP. Our theorems complement some recent and important ones in the literature.


Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1915
Author(s):  
Lateef Olakunle Jolaoso ◽  
Maggie Aphane

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.


2019 ◽  
Vol 29 (1) ◽  
pp. 175-206 ◽  
Author(s):  
Alfredo N. Iusem ◽  
Alejandro Jofré ◽  
Roberto I. Oliveira ◽  
Philip Thompson

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