.png){kind=icon}
返回
Gradient-free distributed optimization with exact convergence
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2022.110474.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. Specifically, at each time-step, the agents locally compute a so-called pseudo-gradient to guide the updates of the decision variables, which can be applied in the fields where the gradient information is unknown, not available or non-existent. A surplus-based method is adopted to remove the doubly stochastic requirement on the weighting matrix, which enables the implementation of the algorithm in graphs having no associated doubly stochastic weighting matrix. For the convergence results, the proposed algorithm is able to obtain the exact convergence to the optimal value with any positive, non-summable and non-increasing stepsizes. Furthermore, when the step-size is also square-summable, the proposed algorithm is guaranteed to achieve the exact convergence to an optimal solution. In addition to the standard convergence analysis, the convergence rate of the proposed algorithm is also investigated. Finally, the effectiveness of the proposed algorithm is verified through numerical simulations.(c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Distributed optimization
Gradient -free methods
Multi -agent systems
Directed graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Resting-state functional connectivity and reading abilities in first and second languages.png)
NeuroImageOAAI
NeuroImageIF0
OAAI分享收藏
查看更多内容