Convergence rate analysis of a subgradient averaging algorithm for distributed optimisation with different constraint sets
We consider a multi-agent setting with agents exchanging information over a network to solve a convex constrained optimisation problem in a distributed manner. We analyse a new algorithm based on local subgradient exchange under undirected time-varying communication. First, we prove asymptotic conve...
Autors principals: | Romao, L, Margellos, K, Notarstefano, G, Papachristodoulou, A |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
Institute of Electrical and Electronics Engineers
2020
|
Ítems similars
-
Subgradient averaging for multi-agent optimization with different constraint sets
per: Romao, L, et al.
Publicat: (2021) -
Convergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
per: Jedsadapong Pioon, et al.
Publicat: (2024-06-01) -
Convergence Analysis of Distributed Subgradient Methods over Random Networks
per: Lobel, Ilan, et al.
Publicat: (2010) -
On the exact feasibility of convex scenario programs with discarded constraints
per: Romao, L, et al.
Publicat: (2022) -
Distributed actuator selection: achieving optimality via a primal-dual algorithm
per: Romao, L, et al.
Publicat: (2018)