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...
Main Authors: | Romao, L, Margellos, K, Notarstefano, G, Papachristodoulou, A |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers
2020
|
Similar Items
-
Subgradient averaging for multi-agent optimization with different constraint sets
by: Romao, L, et al.
Published: (2021) -
Convergence Analysis of Distributed Subgradient Methods over Random Networks
by: Lobel, Ilan, et al.
Published: (2010) -
Distributed actuator selection: achieving optimality via a primal-dual algorithm
by: Romao, L, et al.
Published: (2018) -
On the exact feasibility of convex scenario programs with discarded constraints
by: Romao, L, et al.
Published: (2022) -
Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
by: Romao, L, et al.
Published: (2023)