Implementation of Distributed Asynchronous Algorithms with Stochastic Delays for Solving Time Drifting Optimization Problems

Beidas, B; Papavassilopoulos, G

dc.contributor.author	Beidas, B	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T02:48:10Z
dc.date.available	2014-03-01T02:48:10Z
dc.date.issued	1993	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33587
dc.subject	Almost Sure Convergence	en
dc.subject	Asynchronous Algorithm	en
dc.subject	Communication Delay	en
dc.subject	Optimization Problem	en
dc.subject	Mean Square	en
dc.title	Implementation of Distributed Asynchronous Algorithms with Stochastic Delays for Solving Time Drifting Optimization Problems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/IPPS.1993.262812	en
heal.identifier.secondary	http://dx.doi.org/10.1109/IPPS.1993.262812	en
heal.publicationDate	1993	en
heal.abstract	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	en
heal.journalName	International Parallel and Distributed Processing Symposium/International Parallel Processing Symposium	en
dc.identifier.doi	10.1109/IPPS.1993.262812	en