Related papers: Krasnoselskii-Mann Iterations: Inertia, Perturbati…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…
We introduce and investigate an iterative scheme for approximating common fixed point of a family of Bregman relatively-nonexpansive mappings in real reflexive Banach spaces. We prove strong convergence theorem of the sequence generated by…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
Despite the broad use of fixed-point iterations throughout applied mathematics, the optimal convergence rate of general fixed-point problems with nonexpansive nonlinear operators has not been established. This work presents an acceleration…
The article deals with iterative methods of solving linear operator equations $x = Bx + f$ and $Ax = f$ with self-adjoint operators in Hilbert space $X$ in critical case when $\rho(B) = 1$ and $0 \in {\rm Sp}\, A$. The main results are…
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…
In this article we develop and analyze novel iterative regularization techniques for the solution of systems of nonlinear ill--posed operator equations. The basic idea consists in considering separately each equation of this system and…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
In this paper we present a convergence rate analysis of inexact variants of several randomized iterative methods. Among the methods studied are: stochastic gradient descent, stochastic Newton, stochastic proximal point and stochastic…
The Krasnoselskii-Mann iteration is an important algorithm in optimization and variational analysis for finding fixed points of nonexpansive mappings. In the general case, it produces a sequence converging \emph{weakly} to a fixed point…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
Perturbation theory can be reformulated as dynamical theory. Then a sequence of perturbative approximations is bijective to a trajectory of dynamical system with discrete time, called the approximation cascade. Here we concentrate our…
In this paper, we present a relaxation proximal point method with double inertial effects to approximate a solution of a non-convex equilibrium problem. We give global convergence results of the iterative sequence generated by our…
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…
The purpose of this paper is to introduce a new Kirk type iterative algorithm called Kirk multistep iteration and to study its convergence. We also prove some theorems related with the stability results for the Kirk-multistep and Kirk-SP…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…