In this paper, we study a modified extragradient method for computing a common solution to the split equilibrium problem and fixed point problem of a nonexpansive semigroup in real Hilbert spaces. The weak and strong convergence characteristics of the proposed algorithm are investigated by employing suitable control conditions in such a setting of spaces. As a consequence, we provide a simplified analysis of various existing results concerning the extragradient method in the current literature. We also provide a numerical example to strengthen the theoretical results and the applicability of the proposed algorithm.
The purpose of the present paper is to construct a common solution of the split null point problem associated with the maximal monotone operators and the fixed point problem associated with a finite family of
‐demicontractive operators in Hilbert spaces. We compute the optimal common solution via inertial parallel hybrid algorithm under a suitable set of control conditions. The viability of parallel implementation of the algorithm is demonstrated for various theoretical as well as numerical results. The results presented in this paper improve various existing results in the current literature.
Iterative algorithms are widely applied to solve convex optimization problems under a suitable set of constraints. In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward-backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the monotone inclusion problem and the split mixed equilibrium problem in Hilbert spaces. Moreover, numerical experiments compare favorably the efficiency of the proposed algorithm with the existing algorithms. As a consequence, our results improve various existing results in the current literature.
In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward–backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the fixed point problem associated to a finite family of demicontractive operators, the split equilibrium problem and the monotone inclusion problem in Hilbert spaces. Moreover, we compute a numerical experiment to show the efficiency of the proposed algorithm. As a consequence, our results improve various existing results in the current literature.
In this paper, we compute a common solution of the fixed point problem (FPP) and the generalized split common null point problem (GSCNPP) via the inertial hybrid shrinking approximants in Hilbert spaces. We show that the approximants can be easily adapted to various extensively analyzed theoretical problems in this framework. Finally, we furnish a numerical experiment to analyze the viability of the approximants in comparison with the results presented in (Reich and Tuyen in Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 114:180, 2020).
<abstract><p>This paper provides iterative solutions, via some variants of the extragradient approximants, associated with the pseudomonotone equilibrium problem (EP) and the fixed point problem (FPP) for a finite family of $ \eta $-demimetric operators in Hilbert spaces. The classical extragradient algorithm is embedded with the inertial extrapolation technique, the parallel hybrid projection technique and the Halpern iterative methods for the variants. The analysis of the approximants is performed under suitable set of constraints and supported with an appropriate numerical experiment for the viability of the approximants.</p></abstract>
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.