.png){kind=icon}
返回
ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2019.2896025.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider distributed optimization problems over a multiagent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimizing a class of nonconvex problems and under the challenging setting, where each agent can only access the zeroth-order information (i.e., the functional values) of its local functions. For different types of network topologies, such as undirected connected networks or star networks, we develop efficient distributed algorithms and rigorously analyze their convergence and rate of convergence (to the set of stationary solutions). Numerical results are provided to demonstrate the efficiency of the proposed algorithms.
Keyword:
Distributed optimization
nonconvex optimization
primal-dual algorithms
zeroth-order information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
查看更多内容