Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
This paper investigates the problem of finding a fixed point for a global nonexpansive operator under time-varying communication graphs in real Hilbert spaces, where the global operator is separable and composed of an aggregate sum of local nonexpansive operators. Each local operator is only private...
Main Authors: | Li, Xiuxian, Xie, Lihua |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/152143 |
Similar Items
-
Mean square consensus of multi-agent systems over fading networks with directed graphs
by: Xu, Liang, et al.
Published: (2020) -
Tracking consensus for uncertain nonlinear multi-agent systems under cloud-based event-triggered coordination
by: Hong, Shanshan, et al.
Published: (2023) -
The implementation of computer vision algorithms in fixed point
by: Yang, Yi
Published: (2011) -
End-to-end deep reinforcement learning for multi-agent collaborative exploration
by: Chen, Zichen, et al.
Published: (2021) -
A Coral Reef Algorithm Based on Learning Automata for the Coverage Control Problem of Heterogeneous Directional Sensor Networks
by: Li, Ming, et al.
Published: (2016)