Distributed asynchronous computation of fixed points

By Dimitri P. Bertsekas. 1983

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2016, background): “The research on distributed optimization dates back to 1980s [2,67].”
Stochastic, Distributed and Federated Optimization for Machine Learning (2017, background): “Optimization in distributed setting has been studied for decades, tracing back to at least works of Bertsekas and Tsitsiklis [14, 13, 177].”
A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates (2017, background): “The study on distributed algorithms dates back to early 1980s [2,41].”
On the Convergence of Asynchronous Parallel Iteration with Unbounded Delays (2016, methodology): “[2] proposed an asynchronous distributed iterative method for solving more general fixed-point problems and showed its convergence under a contraction assumption.”
Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing (2006, background): “Most results for linear systems generalizing the celebrated Stein-Rosenberg theorem (see, for example, Bertsekas (1997)), still assume a fixed cyclic order or assume that the mapping satisfies additional properties.”
Reinforcement Learning: An Introduction (1998, methodology): “…programming has been extensively developed since the late 1950s, including extensions to partially observable MDPs (surveyed by Lovejoy, 1991), many applications (surveyed by White, 1985, 1988, 1993), approximation methods (surveyed by Rust, 1996), and asynchronous methods (Bertsekas, 1982, 1983).”
ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates (2015, background): “Totally async-parallel1 iterative methods for a fixed-point problem go back as early as to Baudet [5], where the operator was assumed to be P-contraction.2 Later, Bertsekas [7] generalized the P-contraction assumption and showed convergence.”
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets (1998, methodology): “The convergence of asynchronous iterative methods has been studied by several researchers (e.g., [3, 6 , 10, 14, 45, 46, 72, 73]).”
Distributed multi-task classification: a decentralized online learning approach (2017, background): “Since the pioneering research [35,4,6] in 1980s, distributed optimization problems have attracted extensive studies in different areas.”