时间漂移条件下约束优化问题的随机延迟分布式异步算法

Proceedings of 1994 33rd IEEE Conference on Decision and Control Pub Date : 1994-12-14 DOI:10.1109/CDC.1994.411299

B. F. Beidas, G. Papavassilopoulos

{"title":"时间漂移条件下约束优化问题的随机延迟分布式异步算法","authors":"B. F. Beidas, G. Papavassilopoulos","doi":"10.1109/CDC.1994.411299","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":355623,"journal":{"name":"Proceedings of 1994 33rd IEEE Conference on Decision and Control","volume":"51 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distributed asynchronous algorithms with stochastic delays for constrained optimization problems with conditions of time drift\",\"authors\":\"B. F. Beidas, G. Papavassilopoulos\",\"doi\":\"10.1109/CDC.1994.411299\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":355623,\"journal\":{\"name\":\"Proceedings of 1994 33rd IEEE Conference on Decision and Control\",\"volume\":\"51 12\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 33rd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1994.411299\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 33rd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1994.411299","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

研究了约束集上具有非平稳最小值函数的分布式异步最小化算法。假设处理器间的通信延迟是随机的，具有马尔可夫特征。给出了保证均方和几乎肯定收敛于所求解的条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 to the sought solution are presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of 1994 33rd IEEE Conference on Decision and Control

自引率

0.00%

发文量