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

Abstract

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 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 a fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-varying directed graph N(t). It is shown under suitably general conditions on N(t), that the algorithm causes all agents estimates to converge to the same common fixed point of the m nonlinear maps.

submitted to Transactions on Automatic Control

Cited by in corpus (10)

• Recurrent Averaging Inequalities in Multi-Agent Control and Social Dynamics Modeling
• Asynchronous and time-varying proximal type dynamics multi-agent network games
• Distributed Feedback Control of Multi-Channel Linear Systems
• Delay Robustness of Consensus Algorithms: Beyond The Uniform Connectivity (Extended Version)
• Distributed Control of Linear Multi-Channel Systems
• A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets
• Time-varying constrained proximal type dynamics in multi-agent network games
• Distributed Algorithms for Computing a Fixed Point of Multi-Agent Nonexpansive Operators
• Distributed payoff allocation in coalitional games via time varying paracontractions
• Distributed Algorithms for Computing a Common Fixed Point of a Group of Nonexpansive Operators