scholarly journals Convergence Theorems for the Variational Inequality Problems and Split Feasibility Problems in Hilbert Spaces

Author(s):  
Panisa Lohawech ◽  
Anchalee Kaewcharoen ◽  
Ali Farajzadeh

In this paper, we establish an iterative algorithm by combining Yamada’s hybrid steepest descent method and Wang’s algorithm for finding the common solutions of variational inequality problems and split feasibility problems. The strong convergence of the sequence generated by our suggested iterative algorithm to such a common solution is proved in the setting of Hilbert spaces under some suitable assumptions imposed on the parameters. Moreover, we propose iterative algorithms for finding the common solutions of variational inequality problems and multiple-sets split feasibility problems. Finally, we also give numerical examples for illustrating our algorithms.

2017 ◽  
Vol 33 (1) ◽  
pp. 09-26
Author(s):  
QAMRUL HASAN ANSARI ◽  
◽  
AISHA REHAN ◽  
◽  

Inspired by the recent work of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, Set-Valued Var. Anal., 23 (2015), 205–221], in this paper, we study generalized split feasibility problems (GSFPs) in the setting of Banach spaces. We propose iterative algorithms to compute the approximate solutions of such problems. The weak convergence of the sequence generated by the proposed algorithms is studied. As applications, we derive some algorithms and convergence results for some problems from nonlinear analysis, namely, split feasibility problems, equilibrium problems, etc. Our results generalize several known results in the literature including the results of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, SetValued Var. Anal., 23 (2015), 205–221].


Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 248 ◽  
Author(s):  
Suthep Suantai ◽  
Pronpat Peeyada ◽  
Damrongsak Yambangwai ◽  
Watcharaporn Cholamjiak

In this paper, we study a modified viscosity type subgradient extragradient-line method with a parallel monotone hybrid algorithm for approximating a common solution of variational inequality problems. Under suitable conditions in Hilbert spaces, the strong convergence theorem of the proposed algorithm to such a common solution is proved. We then give numerical examples in both finite and infinite dimensional spaces to justify our main theorem. Finally, we can show that our proposed algorithm is flexible and has good quality for use with common types of blur effects in image recovery.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Mohammad Farid ◽  
Rehan Ali ◽  
Watcharaporn Cholamjiak

In this paper, we introduce and study an iterative algorithm via inertial and viscosity techniques to find a common solution of a split generalized equilibrium and a variational inequality problem in Hilbert spaces. Further, we prove that the sequence generated by the proposed theorem converges strongly to the common solution of our problem. Furthermore, we list some consequences of our established algorithm. Finally, we construct a numerical example to demonstrate the applicability of the theorem. We emphasize that the result accounted in the manuscript unifies and extends various results in this field of study.


2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Congjun Zhang ◽  
Baoqing Liu ◽  
Jun Wei

We solve several kinds of variational inequality problems through gap functions, give algorithms for the corresponding problems, obtain global error bounds, and make the convergence analysis. By generalized gap functions and generalized D-gap functions, we give global bounds for the set-valued mixed variational inequality problems. And through gap function, we equivalently transform the generalized variational inequality problem into a constraint optimization problem, give the steepest descent method, and show the convergence of the method.


2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Yan Tang

We introduce two proximal iterative algorithms with errors which converge strongly to the common solution of certain variational inequality problems for a finite family of pseudocontractive mappings and a finite family of monotone mappings. The strong convergence theorems are obtained under some mild conditions. Our theorems extend and unify some of the results that have been proposed for this class of nonlinear mappings.


Axioms ◽  
2020 ◽  
Vol 9 (2) ◽  
pp. 51
Author(s):  
Godwin Amechi Okeke ◽  
Mujahid Abbas ◽  
Manuel de la Sen

We propose two new iterative algorithms for solving K-pseudomonotone variational inequality problems in the framework of real Hilbert spaces. These newly proposed methods are obtained by combining the viscosity approximation algorithm, the Picard Mann algorithm and the inertial subgradient extragradient method. We establish some strong convergence theorems for our newly developed methods under certain restriction. Our results extend and improve several recently announced results. Furthermore, we give several numerical experiments to show that our proposed algorithms performs better in comparison with several existing methods.


Sign in / Sign up

Export Citation Format

Share Document