Related papers: Distributed Banach-Picard Iteration for Locally Co…
In recent work, we proposed a distributed Banach-Picard iteration (DBPI) that allows a set of agents, linked by a communication network, to find a fixed point of a locally contractive (LC) map that is the average of individual maps held by…
Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the…
This paper investigates the minimax-optimality of Halpern fixed-point iterations for Lipschitz maps in general normed spaces. Starting from an a priori bound on the orbit of iterates, we derive non-asymptotic estimates for the fixed-point…
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…
We introduce "logically contractive mappings" nonexpansive self-maps that contract along a subsequence of iterates and prove a fixed-point theorem that extends Banach's principle. We obtain event-indexed convergence rates and, under bounded…
Most algorithms for solving optimization problems or finding saddle points of convex-concave functions are fixed-point algorithms. In this work we consider the generic problem of finding a fixed point of an average of operators, or an…
This paper deals with an optimization problem over a network of agents, where the cost function is the sum of the individual objectives of the agents and the constraint set is the intersection of local constraints. Most existing methods…
In this letter, we study distributed optimization, where a network of agents, abstracted as a directed graph, collaborates to minimize the average of locally-known convex functions. Most of the existing approaches over directed graphs are…
This paper investigates the distributed fixed point seeking problem of sum-separable stochastic operators over the multi-agent network. Based on inexact Krasnosel'ski\u{\i}--Mann iterations, the communication-efficient distributed algorithm…
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged…
While numerous extensions of Banach's fixed point theorem typically offer only sufficient conditions for the existence and uniqueness of a fixed point and the convergence of iterative sequences, this study introduces a generalization…
We find a priori and a posteriori error estimates of the best proximity point for the Picard iteration associated to a cyclic contraction map, which is defined on a uniformly convex Banach space with modulus of convexity of power type. We…
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…
This paper addresses the problem of seeking a common fixed point for a collection of nonexpansive operators over time-varying multi-agent networks in real Hilbert spaces, where each operator is only privately and approximately known to each…
We prove that Picard-Lindel\"of iterations for an arbitrary smooth normal Cauchy problem for PDE converge if we assume a suitable Weissinger-like sufficient condition. This condition includes both a large class of non-analytic PDE or…
In this paper, a general hybrid fixed point theorem for the contractive mappings in generalized Banach spaces is proved via measure of weak non-compactness and it is further applied to fractional integral equations for proving the existence…
A distributed algorithm is described for finding a common fixed point of a family of m>1 nonlinear maps M_i : R^n -> R^n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…
We introduce a large class of mappings, called enriched contractions, which includes, amongst many other contractive type mappings, the Picard-Banach contractions and some nonexpansive mappings. We show that any enriched contraction has a…
In this paper, we study a new iterative method for a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the frame work of reflexive real Banach spaces. Moreover, we prove the strong convergence theorem for…