A gradient-free distributed optimization method for convex sum of nonconvex cost functions
This article presents a special type of distributed optimization problems, where the summation of agents' local cost functions (i.e., global cost function) is convex, but each individual can be nonconvex. Unlike most distributed optimization algorithms by taking the advantages of gradient, the...
Saved in:
Main Authors: | Pang, Yipeng, Hu, Guoqiang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170517 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Gradient-free distributed optimization with exact convergence
by: Pang, Yipeng, et al.
Published: (2022) -
Exact convergence of gradient-free distributed optimization method in a multi-agent system
by: Pang, Yipeng, et al.
Published: (2020) -
Randomized gradient-free distributed online optimization via a dynamic regret analysis
by: Pang, Yipeng, et al.
Published: (2023) -
DESTRESS: Computation-optimal and communication-efficient decentralized nonconvex finite-sum optimization
by: LI, Boyue, et al.
Published: (2022) -
Simple and optimal stochastic gradient methods for nonsmooth nonconvex optimization
by: LI, Zhize, et al.
Published: (2022)