General semi-implicit approximations with errors for common fixed points of nonexpansive-type operators and applications to Stampacchia variational inequality
Abstract:It is meaningful and valuable to find common fixed points of different nonexpansive-type operators, which are associated with variational inequalities, integral equations, image process and other optimization problems in real life. The purpose of this paper is to suggest and consider a class of general semi-implicit iterative methods involving semi-implicit rule and inaccurate computing errors, which extend the iterative algorithm introduced by Ali et al. in 2020. Using Liu’s lemma, we analyze convergence and … Show more
“…On the other hand, it is well known that the implicit rule is one powerful tool in the field of ordinary differential equations and is widely used to construct the iteration scheme for (asymptotically) nonexpansive-type operators; see, for example, [15][16][17][18][19] and the references therein. Of particular note is that Aibinu and Kim [20] compared the convergence rates of the following two viscosity implicit iterations:…”
Section: Introductionmentioning
confidence: 99%
“…where {a n }, {b n }, {c n }, and {d n } are four sequences satisfied by special conditions, and S and T are two self operators for H. They also proved that iteration (10) converges faster than (9) under some prerequisites. Due to the complexity and effectiveness of the implicit rules (see [19]), there are few pieces of research on implicit iterations for the more general asymptotically demicontractive operators. Thus, the following question comes naturally: Question 1.…”
It is very meaningful and challenging to efficiently seek common solutions to operator systems (CSOSs), which are widespread in pure and applied mathematics, as well as some closely related optimization problems. The purpose of this paper is to introduce a novel class of multistep implicit iterative algorithms (MSIIAs) for solving general CSOSs. By using Xu’s lemma and Maingé’s fundamental and important results, we first obtain strong convergence theorems for both one-step and multistep implicit iterative schemes for CSOSs, involving asymptotically demicontractive operators. Finally, for the applications and profits of the main results presented in this paper, we give two numerical examples and present an iterative approximation to solve the general common solution to the variational inequalities and operator equations.
“…On the other hand, it is well known that the implicit rule is one powerful tool in the field of ordinary differential equations and is widely used to construct the iteration scheme for (asymptotically) nonexpansive-type operators; see, for example, [15][16][17][18][19] and the references therein. Of particular note is that Aibinu and Kim [20] compared the convergence rates of the following two viscosity implicit iterations:…”
Section: Introductionmentioning
confidence: 99%
“…where {a n }, {b n }, {c n }, and {d n } are four sequences satisfied by special conditions, and S and T are two self operators for H. They also proved that iteration (10) converges faster than (9) under some prerequisites. Due to the complexity and effectiveness of the implicit rules (see [19]), there are few pieces of research on implicit iterations for the more general asymptotically demicontractive operators. Thus, the following question comes naturally: Question 1.…”
It is very meaningful and challenging to efficiently seek common solutions to operator systems (CSOSs), which are widespread in pure and applied mathematics, as well as some closely related optimization problems. The purpose of this paper is to introduce a novel class of multistep implicit iterative algorithms (MSIIAs) for solving general CSOSs. By using Xu’s lemma and Maingé’s fundamental and important results, we first obtain strong convergence theorems for both one-step and multistep implicit iterative schemes for CSOSs, involving asymptotically demicontractive operators. Finally, for the applications and profits of the main results presented in this paper, we give two numerical examples and present an iterative approximation to solve the general common solution to the variational inequalities and operator equations.
“…Akram et al (5) worked on FPP and split variational inclusion problem. Many researchers introduced different iterative schemes to find out the solutions of VIPs (6)(7)(8)(9)(10)(11) . Lamba and Panwar (12) and Panwar et al (13) introduced iterative schemes for nonexpansive mappings.…”
Objectives:The objective of the paper is to find the solutions of variational inequality problems via the concept of common fixed point of a sequence of nearly nonexpansive mappings. Methods: The present work uses three step iterative algorithm to get the solutions of variational inequality problems. Findings: By applying three step iterative algorithm, solutions of variational inequality problem has been obtained. Novelty: In the present work, a specific three step iterative algorithm has been deployed to get solution. Furthermore, Matlab programming has been utilised to eastablish the accuracy of the results.
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.