{"title":"求解时间漂移优化问题的随机延迟分布式异步算法的实现","authors":"B. F. Beidas, G. Papavassilopoulos","doi":"10.1109/IPPS.1993.262812","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems\",\"authors\":\"B. F. Beidas, G. Papavassilopoulos\",\"doi\":\"10.1109/IPPS.1993.262812\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262812\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems
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.<>