The purpose of this article is to introduce two iterative algorithms for finding a common fixed point of a semigroup of asymptotically nonexpansive mappings which is a unique solution of someâ€¦ (More)

In this article, we introduce iterative methods (implicit and explicit) for finding a common fixed point set of a countable family of strict pseudo-contractions, which is a unique solution of someâ€¦ (More)

In this article, we introduce a new multi-step iteration for approximating a common fixed point of a finite class of multi-valued Bregman relatively nonexpansive mappings in the setting of reflexiveâ€¦ (More)

and Applied Analysis 3 Definition 1.1. A one-parameter family mapping S {T t : t âˆˆ R } from C into itself is said to be a nonexpansive semigroup on C if it satisfies the following conditions: i T 0 xâ€¦ (More)

In this paper, we introduce an iterative algorithm for finding the set of common fixed points of nonexpansive semigroups by the generalized viscosity implicit rule in certain Banach spaces which hasâ€¦ (More)

and Applied Analysis 3 The generalized mixed equilibrium problems with perturbation is very general in the sense that it includes fixed point problems, optimization problems, variational inequalityâ€¦ (More)

In this paper, we introduce viscosity approximation methods based on generalized contractionmappings for finding a set of common fixed points of a countable family of strictâ€¦ (More)

In this work, we introduce implicit and explicit iterations for solving the variational inclusion problem for the sum of two operators and the fixed point problem of nonexpansive mappings. We thenâ€¦ (More)

In this paper, we introduce new implicit and explicit iterative methods for finding a common fixed point set of an infinite family of strict pseudo-contractions by the sunny nonexpansive retractionsâ€¦ (More)

The purpose of this paper is to introduce a new mapping for a finite family of accretive operators and introduce an iterative algorithm for finding a common zero of a finite family of accretiveâ€¦ (More)