Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift

A distributed asynchronous algorithm for minimizing a function with a nonstationary minimum over a constraint set is considered. The communication delays among the processors are assumed to be stochastic with Markovian character. Conditions which guarantee the mean square and almost sure convergence...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Parallel computing Jg. 21; H. 9; S. 1431 - 1450
Hauptverfasser:	Beidas, Bassem F., Papavassilopoulos, George P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.09.1995 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Asynchronous iteration Computer science; control theory; systems Computer systems and distributed systems. User interface Convergence analysis Exact sciences and technology Multiprocessor environment Optimization problem Software Stochastic communication delay Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Theoretical computing Asynchronous iteration Stochastic communication delay Multiprocessor environment Optimization problem Convergence analysis Multiprocessor Asynchronous Simulation Programming environment Distributed algorithm Routing Stochastic approximation Iterative method Implementation Delay Convergence Constrained optimization
ISSN:	0167-8191, 1872-7336
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!