## Abstract

This paper studies a distributed algorithm 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 strongly quasi-nonexpansive, and that at least one such common fixed point exists. A common fixed point is simultaneously and recursively computed by m agents assuming that each agent i knows only M_{i}, the current estimates of the fixed point generated by its neighbors, and nothing more. Neighbor relationships are described by a time-varying directed graph ℕ(t) whose vertices correspond to agents and whose arcs depict neighbor relationships. It is shown that for any sequence of repeatedly jointly strongly connected neighbor graphs ℕ(t), t ϵ {1, 2,⋯}, the algorithm causes all agents' estimates to converge to a common fixed point of M_{i}, i ϵ {1, 2,⋯, m}.

Original language | English (US) |
---|---|

Title of host publication | 2017 American Control Conference, ACC 2017 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 686-690 |

Number of pages | 5 |

ISBN (Electronic) | 9781509059928 |

DOIs | |

State | Published - Jun 29 2017 |

Event | 2017 American Control Conference, ACC 2017 - Seattle, United States Duration: May 24 2017 → May 26 2017 |

### Other

Other | 2017 American Control Conference, ACC 2017 |
---|---|

Country | United States |

City | Seattle |

Period | 5/24/17 → 5/26/17 |

## ASJC Scopus subject areas

- Electrical and Electronic Engineering