In this paper, we introduce a new iteration scheme, named as the S**-iteration scheme, for approximation of fixed point of the nonexpansive mappings. This scheme is faster than Picard, Mann, Ishikawa, Noor, Agarwal, Abbas, Thakur, and Ullah iteration schemes. We show the stability of our instigated scheme and give a numerical example to vindicate our claim. We also put forward some weak and strong convergence theorems for Suzuki's generalized nonexpansive mappings in the setting of uniformly convex Banach spaces. Our results comprehend, improve, and consolidate many results in the existing literature.

The purpose of this paper is to prove strong convergent theorems for Browder's type iterations and Halpern's type iterations of a family of nonexpansive mappings in a complete geodesic space with curvature bounded above by a positive number. Moudafi's viscosity type methods are also discussed without the nice projection property.

In a p-uniformly convex and uniformly smooth Banach space, let the pair of variational inequality and fixed point problems (VIFPPs) consist of two variational inequality problems (VIPs) involving two uniformly continuous and pseudomonotone mappings and two fixed point problems implicating two uniformly continuous and Bregman relatively asymptotically nonexpansive mappings. This article designs two parallel subgradient-like extragradient algorithms with inertial effect for solving this pair of VIFPPs, where each algorithm consists of two parts which are of symmetric structure mutually. Under mild registrations, we prove weak and strong convergence of the suggested algorithms to a common solution of this pair of VIFPPs, respectively. Lastly, an illustrative example is furnished to verify the applicability and implementability of our proposed approaches.

In this work, we extend the fundamental results of Schu to the class of monotone asymptotically nonexpansive mappings in modular function spaces. In particular, we study the behavior of the Fibonacci-Mann iteration process defined by $$x_{n+1} = t_n T^{\phi(n)}(x_n) + (1-t_n)x_n,$$ for $n \in \mathbb{N}$, when $T$ is a monotone asymptotically nonexpansive self-mapping.

In this paper, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces, which are more general than Hilbert spaces. Under mild conditions, we derive weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed methods.