Composite optimization with coupling constraints via penalized proximal gradient method in asynchronous networks
In this paper, we consider a composite optimization problem with linear coupling constraints in a multi-agent network. In this problem, the agents cooperatively optimize a strongly convex cost function which is the linear sum of individual cost functions composed of smooth and possibly non-smooth co...
Saved in:
Main Authors: | Wang, Jianzheng, Hu, Guoqiang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170708 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
by: Wang, Jianzheng, et al.
Published: (2022) -
Exact convergence of gradient-free distributed optimization method in a multi-agent system
by: Pang, Yipeng, et al.
Published: (2020) -
Convergence of asynchronous distributed gradient methods over stochastic networks
by: Xu, Jinming, et al.
Published: (2020) -
Distributed nonlinear hierarchical control of AC microgrid via unreliable communication
by: Cai, He, et al.
Published: (2020) -
Randomized gradient-free distributed online optimization via a dynamic regret analysis
by: Pang, Yipeng, et al.
Published: (2023)