Abstract
We present a model for asynchronous distributed computation and analyze the convergence of natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms. We show that such algorithms retain the desirable convergence properties of their centralized counterparts, provided that the time between consecutive communications between processors plus communication delays are not too large.
Original language | English (US) |
---|---|
Pages (from-to) | 484-489 |
Number of pages | 6 |
Journal | Proceedings of the American Control Conference |
Volume | 1 |
DOIs | |
State | Published - 1984 |
Externally published | Yes |
ASJC Scopus subject areas
- Electrical and Electronic Engineering