Related papers: Algorithms Based on Unions of Nonexpansive Maps
The main purpose of this work is to extend the properties of multivalued transformations to the integral type transformations and to obtain the existence of fixed points under F-contraction. In addition, the results of this study were…
Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that…
We consider a Hilbert space that is a product of a finite number of Hilbert spaces and operators that are represented by "componental operators" acting on the Hilbert spaces that form the product space. We attribute operatorial properties…
In this paper, we are concerned with the study of the existence of fixed points for single and multi-valued three-points contractions. Namely, we first introduce a new class of single-valued mappings defined on a metric space equipped with…
Reference [11] investigated the almost sure weak convergence of block-coordinate fixed point algorithms and discussed their applications to nonlinear analysis and optimization. This algorithmic framework features random sweeping rules to…
Learned image reconstruction has become a pillar in computational imaging and inverse problems. Among the most successful approaches are learned iterative networks, which are formulated by unrolling classical iterative optimisation…
Firmly nonexpansive mappings play an important role in metric fixed point theory and optimization due to their correspondence with maximal monotone operators. In this paper we do a thorough study of fixed point theory and the asymptotic…
Firstly, we invoke the weak convergence (resp. strong convergence) of translated basic methods involving nonexpansive operators to establish the weak convergence (resp. strong convergence) of the associated method with both perturbation and…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
We study the existence and uniqueness of (locally) absolutely continuous trajectories of a dynamical system governed by a nonexpansive operator. The weak convergence of the orbits to a fixed point of the operator is investigated by relying…
The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…
In this paper we are going to prove a very general fixed point theorem for mappings acting in partial metric spaces. In that theorem we impose some conditions on behavior of considered mappings on orbits and a condition relating orbits of…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
We establish linear convergence of relocated fixed-point iterations as introduced by Atenas et al. (2025) assuming the algorithmic operator satisfies a linear error bound. In particular, this framework applies to the setting where the…
This paper is a continuation to the study of generalized quasi contractive operators, essentially due to Akhtar et al. [A multi-step implicit iterative process for common fixed points of generalized C^{q}-operators in convex metric spaces,…
This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…
We associate to each iterated function system consisting of phi-max-contractions an operator (on the space of continuous functions from the shift space on the metric space corresponding to the system) having a unique fixed point whose image…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…