### A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions

**2016-02-03**

1602.01483 | math.OC

A distributed algorithm is described for finding a common fixed point of a
family of $m>1$ nonlinear maps $M_i : \mathbb{R}^n \rightarrow \mathbb{R}^n$
assuming that each map is a paracontraction and that such a common fixed point
exists. The common fixed point is simultaneously computed by $m$ agents
assuming each agent $i$ knows only $M_i$, the current estimates of the fixed
point generated by its neighbors, and nothing more. Each agent recursively
updates its estimate of the fixed point by utilizing the current estimates
generated by each of its neighbors. Neighbor relations are characterized by a
time-dependent directed graph $\mathbb{N}(t)$ whose vertices correspond to
agents and whose arcs depict neighbor relations. It is shown that for any
family of paracontractions $M_i, i \in \{1,2,\ldots,m\}$ which has at least one
common fixed point, and any sequence of strongly connected neighbor graphs
$\mathbb{N}(t)$, $t=1,2,\ldots$, the algorithm causes all agent estimates to
converge to a common fixed point.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2016-01-12**

1601.02712 | cs.DS

In this paper we present a connection between two dynamical systems arising
in entirely different co… show more

**2019-01-27**

1901.09423 | cs.CC

This paper presents a deterministic, strongly polynomial time algorithm for
computing the matrix ran… show more

**2018-09-23**

1809.08694 | math.OC

We consider distributed smooth nonconvex unconstrained optimization over
networks, modeled as a conn… show more

**2018-11-19**

1811.07799 | cs.MA

This paper addresses the problem of distributed learning of average belief
with sequential observati… show more

**2019-03-13**

1903.05486 | cs.SY

A simply structured distributed observer is described for estimating the
state of a discrete-time, j… show more

**2018-10-22**

1810.09569 | cs.LG

One of the common tasks in unsupervised learning is dimensionality reduction,
where the goal is to f… show more

**2019-04-07**

1904.03764 | cs.CG

Let ${\cal M} \subset \mathbb{R}^d$ be a compact, smooth and boundaryless
manifold with dimension $m… show more

**2018-12-04**

1812.01595 | cs.CG

A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is
called a \emph{wheel se… show more

**2018-10-15**

1810.06653 | math.OC

In this paper, we focus on solving a distributed convex optimization problem
in a network, where eac… show more

**2019-03-20**

1903.08752 | cs.LG

This paper considers the problem of Byzantine fault tolerance in distributed
linear regression in a … show more

**2018-12-24**

1812.09819 | math.OC

We study the convergence of the log-linear non-Bayesian social learning
update rule, for a group of … show more

**2017-06-16**

1706.05441 | math.OC

In this paper, we develop a class of decentralized algorithms for solving a
convex resource allocati… show more

**2017-06-10**

1706.03158 | cs.SY

We consider a certain class of nonlinear maps that preserve the probability
simplex, i.e., stochasti… show more

**2019-03-28**

1903.12018 | cs.SY

We consider the problem of optimal decentralized estimation of a linear
stochastic process by multip… show more

**2019-02-13**

1902.04811 | cs.LG

This paper considers the perturbed stochastic gradient descent algorithm and
shows that it finds $\e… show more

**2017-07-10**

1707.02757 | cs.DS

Several fundamental problems that arise in optimization and computer science
can be cast as follows:… show more