Distributed Asynchronous Algorithms with Stochastic Delays for Constrained Optimization Problems with Conditions of Time Drift

Beidas, B; Papavassilopoulos, G

dc.contributor.author	Beidas, B	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:43:07Z
dc.date.available	2014-03-01T01:43:07Z
dc.date.issued	1995	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24045
dc.subject	Almost Sure Convergence	en
dc.subject	Asynchronous Algorithm	en
dc.subject	Communication Delay	en
dc.subject	Constrained Optimization Problem	en
dc.subject	Convergence Analysis	en
dc.subject	Optimal Routing	en
dc.subject	Optimization Problem	en
dc.subject	Probability Distribution	en
dc.subject	Mean Square	en
dc.title	Distributed Asynchronous Algorithms with Stochastic Delays for Constrained Optimization Problems with Conditions of Time Drift	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0167-8191(95)00005-9	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0167-8191(95)00005-9	en
heal.publicationDate	1995	en
heal.abstract	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 to the sought solution are presented. We also present an optimal routing application for a network that connects	en
heal.journalName	Parallel Computing	en
dc.identifier.doi	10.1016/0167-8191(95)00005-9	en