Related papers: Approximating Fixed Points of Nonexpansive Mapping…
In [C.W. Gear, T.J. Kaper, I.G. Kevrekidis, and A. Zagaris, Projecting to a Slow Manifold: Singularly Perturbed Systems and Legacy Codes, SIAM J. Appl. Dyn. Syst. 4 (2005) 711-732], we developed a class of iterative algorithms within the…
In this paper, the local convergence of Iteratively regularized Landweber iteration method is investigated for solving non-linear inverse problems in Banach spaces. Our analysis mainly relies on the assumption that the inverse mapping…
This paper is a close follow-up of Kaltenbacher and Tomba 2013 and Jin 2012, where Newton-Landweber iterations have been shown to converge either (unconditionally) without rates or (under an additional regularity assumption) with rates. The…
In this paper, we introduce a new iterative method to find a common solution of a generalized mixed equilibrium problem, a variational inequality problem and a hierarchical fixed point problem for a demicontinuous nearly nonexpansive…
Our purpose in this paper is (i) to introduce the concept of further generalized hybrid mappings (ii) to introduce the concept of common attractive points (CAP) (iii) to write and use Picard-Mann iterative process for two mappings. We…
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…
The Krasnosel'ski\u{\i}--Mann and Halpern iterations are classical schemes for approximating fixed points of nonexpansive mappings in Banach spaces, and have been widely studied in more general frameworks such as $CAT(\kappa)$ and, more…
We study the generic behavior of the method of successive approximations for set-valued mappings in Banach spaces. We consider, in particular, the case of those set-valued mappings which are defined by pairs of nonexpansive mappings and…
In this paper, we introduce a novel two-point gradient method for solving the ill-posed problems in Banach spaces and study its convergence analysis. The method is based on the well known iteratively regularized Landweber iteration method…
We shall generalize the concept of $z=(1-t)x\oplus ty$ to $n$ times which contains to verifying some their properties and inequalities in CAT(0) spaces. In the sequel with introducing of $\alpha$-nonexpansive mappings, we obtain some fixed…
Banach's fixed point theorem in linear n-normed space is being developed. Also, we present several theorems on fixed points in linear n-normed space.
In this paper, we investigate the existence of fixed points for asymptotically nonexpansive mappings with center 0 defined on closed convex subsets of various Banach spaces. Three applications are given. Firstly, we prove that our results…
We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…
In this paper, a simple proof is presented for the convergence of the algorithms for the class of relaxed $(u, v)$-cocoercive mappings and $\alpha$-inverse strongly monotone mappings. Based on $\alpha$-expansive maps, for example, a simple…
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…
We propose an adaptive way to choose the anchoring parameters for the Halpern iteration to find a fixed point of a nonexpansive mapping in a real Hilbert space. We prove strong convergence of this adaptive Halpern iteration and obtain the…
Let C be a nonempty, bounded, closed, and convex subset of a Banach space X and $T : C \rightarrow C$ be a monotone asymptotic nonexpansive mapping. In this paper, we investigate the existence of fixed points of T. In particular, we…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
The Halpern algorithm is a powerful fixed point approximation method for finding the closest point in the fixed point set of a nonexpansive mapping to the initial point. However, in practice, it is not necessarily true that this algorithm…
In this study we provide several significant generalisations of Banach contraction principle where the Lipschitz constant is substituted by real-valued control function that is a comparison function. We study non-stationary variants of…