相关论文: A Picard-S Iterative Scheme for Approximating Fixe…

In this paper, we unify all know iterative methods by introducing a new explicit iterative scheme for approximation of common fixed points of finite families of total asymptotically $I$-nonexpansive mappings. Note that such a scheme…

This paper considers a networked system with a finite number of users and supposes that each user tries to minimize its own private objective function over its own private constraint set. It is assumed that each user's constraint set can be…

We establish the existence of a common fixed point for mappings that satisfy and extend the F-contraction condition. To support our findings, we present pertinent definitions and properties associated with F-contraction mappings.…

We prove that the fixed point iteration of arbitrary positive concave mappings with nonempty fixed point set converges geometrically for any starting point. We also show that positivity is crucial for this result to hold, and the concept of…

In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two monotone equilibrium bifunctions in Hilbert spaces. Under suitable conditions and without any restrictive assumption on the trajectories,…

Herein, a methodology is developed to replicate functions, measures and stochastic processes onto a compact metric space. Many results are easily established for the replica objects and then transferred back to the original ones. Two…

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with…

Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…

Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…

We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…

The aim of this note is to present the simple observation that a slight refinement of the Contraction Mapping Principle allows one to recover the precise convergence rate in the Picard-Lindel\"of Theorem.

Alternative iterative methods for a nonexpansive mapping in a Banach space are proposed and proved to be convergent to a common solution to a fixed point problem and a variational inequality. We give rates of asymptotic regularity for such…

Recent empirical studies have identified fixed point iteration phenomena in deep neural networks, where the hidden state tends to stabilize after several layers, showing minimal change in subsequent layers. This observation has spurred the…

This paper discusses, certain algebraic, analytic, and topological results on partial iterated function systems($IFS_p$'s). Also, the article proves the Collage theorem for partial iterated function systems. Further, it provides a method to…

We consider the monotone inclusion problems in real Hilbert spaces. Proximal splitting algorithms are very popular technique to solve it and generally achieve weak convergence under mild assumptions. Researchers assume the strong conditions…

We develop a fixed-point iterative algorithm that computes the matrix projection with respect to the Bures distance on the set of positive definite matrices that are invariant under some symmetry. We prove that the fixed-point iteration…

Iterative Closest Point (ICP) is a widely used method for performing scan-matching and registration. Being simple and robust method, it is still computationally expensive and may be challenging to use in real-time applications with limited…

In this article, we demonstrate the common fixed point theorems for three transformations on vector S-metric space by utilizing weakly compatible and point of coincidence. Moreover, some of our results generalize the existing results in the…

This paper studies an application of a recurrent neural network to clustering method for the S-P chart: a binary data set used widely in education. As the number of students increases, the S-P chart becomes hard to handle. In order to…