.png){kind=icon}
返回
Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2020.3024321.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed multiagent optimization finds many applications in distributed learning, control, estimation, etc. Most existing algorithms assume knowledge of first-order information of the objective and have been analyzed for convex problems. However, there are situations where the objective is nonconvex, and one can only evaluate the function values at finitely many points. In this article, we consider derivative-free distributed algorithms for nonconvex multiagent optimization, based on recent progress in zero-order optimization. We develop two algorithms for different settings, provide detailed analysis of their convergence behavior, and compare them with existing centralized zero-order algorithms and gradient-based distributed algorithms.
Keyword:
Distributed optimization
nonconvex optimization
zero-order information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
Application of a cholinesterase biosensor to screen for organophosphorus pesticides extracted from soil.png)
Talanta
TalantaIF0
PREAI
分享收藏
查看更多内容