Convergence Analysis of Distributed Asynchronous Iterative Processes

Abstract We consider a model of distributed iterative algorithms whereby several processors participate in the computation while collecting, possibly stochastic information from the environment or other processors via communication links. Several applications in distributed optimization, parameter estimation, and communication networks are described. Issues of asymptotic convergence and agreement are explored under very weak assumptions on the ordering of computations and the timing of information reception. Progress towards constructing a broadly applicable theory is surveyed.

[1]  Dimitri Bertsekas,et al.  Distributed dynamic programming , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[2]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[3]  John N. Tsitsiklis,et al.  Convergence theories of distributed iterative processes: A survey , 1986 .

[4]  Dimitri P. Bertsekas Distributed Computation of Fixed Points. , 1981 .