scholarly journals New Tseng’s extragradient methods for pseudomonotone variational inequality problems in Hadamard manifolds

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.

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 ◽  
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.


2015 ◽  
Vol 7 (2) ◽  
pp. 69
Author(s):  
Haiwen Xu

The  alternating directions method for a kind of structured variational inequality problem (He, 2001) is an attractive method for structured monotone variational inequality problems. In each iteration, the subproblemsare  convex quadratic minimization problem with simple constraintsand a well-conditioned system of nonlinear equations that can be efficiently solvedusing classical methods. Researchers have recently described the convergence rateof projection and contraction methods for variational inequality problems andthe original ADM and its linearized variant. Motivated and inspired by researchinto the convergence rate of these methods, we provide a simple proof to show the $O(1/k)$ convergencerate of  alternating directions methods for structured monotone variational inequality problems (He, 2001).


2021 ◽  
Vol 10 (12) ◽  
pp. 3597-3623
Author(s):  
F. Akusah ◽  
A.A. Mebawondu ◽  
H.A. Abass ◽  
M.O. Aibinu ◽  
O.K. Narain

The research efforts of this paper is to present a new inertial relaxed Tseng extrapolation method with weaker conditions for approximating the solution of a variational inequality problem, where the underlying operator is only required to be pseudomonotone. The strongly pseudomonotonicity and inverse strongly monotonicity assumptions which the existing literature used are successfully weakened. The strong convergence of the proposed method to a minimum-norm solution of a variational inequality problem are established. Furthermore, we present an application and some numerical experiments to show the efficiency and applicability of our method in comparison with other methods in the literature.


2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Suhel Ahmad Khan ◽  
Naeem Ahmad

We introduce strong vector mixed quasi-complementarity problems and the corresponding strong vector mixed quasi-variational inequality problems. We establish equivalence between strong mixed quasi-complementarity problems and strong mixed quasi-variational inequality problem in Banach spaces. Further, using KKM-Fan lemma, we prove the existence of solutions of these problems, under pseudomonotonicity assumption. The results presented in this paper are extensions and improvements of some earlier and recent results in the literature.


2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Kaleem Raza Kazmi

AbstractIn this paper, we introduce a split general quasi-variational inequality problem which is a natural extension of a split variational inequality problem, quasivariational and variational inequality problems in Hilbert spaces. Using the projection method, we propose an iterative algorithm for a split general quasi-variational inequality problem and discuss some special cases. Further, we discuss the convergence criteria of these iterative algorithms. The results presented in this paper generalize, unify and improve many previously known results for quasi-variational and variational inequality problems.


Author(s):  
Ya. I. Vedel ◽  
S. V. Denisov ◽  
V. V. Semenov

In this paper, we consider bilevel problem: variational inequality problem over the set of solutions the equilibrium problems. To solve this problem, an iterative algorithm is proposed that combines the ideas of a two-stage proximal method and iterative regularization. For monotone bifunctions of Lipschitz type and strongly monotone Lipschitz continuous operators, the theorem on strong convergence of sequences generated by the algorithm is proved.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Mostafa Ghadampour ◽  
Donal O’Regan ◽  
Ebrahim Soori ◽  
Ravi P. Agarwal

In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends a recent paper (Thong et al., Numerical Algorithms. 78, 1045-1060 (2018)). We reduce and refine some of their algorithm conditions and we prove the convergence of the algorithm in the presence of some computational errors. Then, using the MATLAB software, the result will be illustrated with some numerical examples. Also, we compare our algorithm with some other well-known algorithms.


2016 ◽  
Vol 2016 ◽  
pp. 1-6
Author(s):  
Yali Zhao ◽  
Dongxue Han

We introduce a split general strong nonlinear quasi-variational inequality problem which is a natural extension of a split general quasi-variational inequality problem, split variational inequality problem, and quasi-variational and variational inequality problems in Hilbert spaces. Using the projection method, we propose an iterative algorithm for the split general strongly nonlinear quasi-variational inequality problem and discuss the convergence criteria of the iterative algorithm. The results presented here generalized, unify, and improve many previously known results for quasi-variational and variational inequality problems.


Sign in / Sign up

Export Citation Format

Share Document