A distributed asynchronous algorithm that minimizes a functional whose minimum drifts with time is discussed. The communication delays among the processors are assumed to be stochastic with Markovian character. The authors present conditions under which the mean square and almost sure convergence to the sought nonstationary solution are guaranteed
Published in:
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Date of Conference: 13-16 Apr 1993