.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Distributed optimization
nonconvex optimization
zero-order information
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.7K
Citations:
5.8K
Organization
Cited Papers
ShareSaveApplication of a cholinesterase biosensor to screen for organophosphorus pesticides extracted from soil.png)
Talanta
TalantaIF0
PREAI
ShareSave
View more