A communication-efficient distributed algorithm for fixed-point seeking of biased stochastic operators with convergence guarantees under relaxed conditions and unification to non-convex optimization.
Distributed Ba- nach–Picard iteration for locally contractive maps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Seeking for Fixed Points of Biased Stochastic Operators: A Communication Efficient Approach
A communication-efficient distributed algorithm for fixed-point seeking of biased stochastic operators with convergence guarantees under relaxed conditions and unification to non-convex optimization.