Gradient-free distributed optimization with exact convergence
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...
Saved in:
Main Authors: | Pang, Yipeng, Hu, Guoqiang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/163543 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A gradient-free distributed optimization method for convex sum of nonconvex cost functions
by: Pang, Yipeng, et al.
Published: (2023) -
Exact convergence of gradient-free distributed optimization method in a multi-agent system
by: Pang, Yipeng, et al.
Published: (2020) -
Nash equilibrium seeking in N-coalition games via a gradient-free method
by: Pang, Yipeng, et al.
Published: (2022) -
Randomized gradient-free distributed online optimization via a dynamic regret analysis
by: Pang, Yipeng, et al.
Published: (2023) -
Gradient-free nash equilibrium seeking in N-cluster games with uncoordinated constant step-sizes
by: Pang, Yipeng, et al.
Published: (2023)