2020
DOI: 10.48550/arxiv.2008.06636
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

DOT and DOP: Linearly Convergent Algorithms for Finding Fixed Points of Multi-Agent Operators

Xiuxian Li,
Min Meng,
Lihua Xie

Abstract: This paper investigates the distributed fixed point finding problem for a global operator over a directed and unbalanced multi-agent network, where the global operator is quasinonexpansive and only partially accessible to each individual agent. Two cases are addressed, that is, the global operator is sum separable and block separable. For this first case, the global operator is the sum of local operators, which are assumed to be Lipschitz, and each local operator is privately known to each individual agent. To… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…Also note that time-varying operator is now only addressed in the centralized manner. Nonetheless, the time-invariant scenario has been taken into account in the decentralized fashion in recent years [62]- [65], leaving the time-varying case as one of future directions.…”
Section: S-regmentioning
confidence: 99%
“…Also note that time-varying operator is now only addressed in the centralized manner. Nonetheless, the time-invariant scenario has been taken into account in the decentralized fashion in recent years [62]- [65], leaving the time-varying case as one of future directions.…”
Section: S-regmentioning
confidence: 99%