.png){kind=icon}
返回
Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2019.2914025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a randomized gradient-free distributed optimization algorithm to solve a multiagent optimization problem with set constraints. Random gradient-free oracle instead of the true gradient information is built locally such that the estimated gradient information is utilized in guiding the update of decision variables. Thus, the algorithm requires no explicit expressions but only local measurements of the cost functions. The row-stochastic and column-stochastic matrices are used as the weighting matrices during the communication with neighbors, making the algorithm convenient to implement in directed graphs as compared with the doubly stochastic weighting matrix. Without the true gradient information, we establish asymptotic convergence to the approximated optimal solution, where the optimality gap can be set arbitrarily small. Moreover, it is shown that the proposed algorithm achieves the same rate of convergence $O(\ln t/\sqrt{t})$ as the state-of-the-art gradient-based methods with similar settings, but having the advantages of less required information and more practical communication topologies.
Keyword:
Directed graphs
distributed optimization
gradient-free methods
multi-agent systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Resting-state functional connectivity and reading abilities in first and second languages.png)
NeuroImage
OAAI
NeuroImageIF0
OAAI分享收藏
查看更多内容