Approximating Fixed Points Using a Faster Iterative Method and Application to Split Feasibility Problems

In this article, the recently introduced iterative scheme of Hassan et al. (Math. Probl. Eng. 2020) is re-analyzed with the connection of Reich–Suzuki type nonexpansive (RSTN) maps. Under mild conditions, some important weak and strong convergence results in the context of uniformly convex Banach spaces are provided. To support the main outcome of the paper, we provide a numerical example and show that this example properly exceeds the class of Suzuki type nonexpansive (STN) maps. It has been shown that the Hassan et al. iterative scheme of this example is more useful than the many other iterative schemes. We provide an application of our main results to solve split feasibility problems in the setting of RSTN maps. The presented outcome is new and compliments the corresponding results of the current literature.

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

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.