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...
मुख्य लेखकों: | Romao, L, Margellos, K, Notarstefano, G, Papachristodoulou, A |
---|---|
स्वरूप: | Conference item |
भाषा: | English |
प्रकाशित: |
Institute of Electrical and Electronics Engineers
2020
|
समान संसाधन
-
Subgradient averaging for multi-agent optimization with different constraint sets
द्वारा: Romao, L, और अन्य
प्रकाशित: (2021) -
Convergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
द्वारा: Jedsadapong Pioon, और अन्य
प्रकाशित: (2024-06-01) -
Convergence Analysis of Distributed Subgradient Methods over Random Networks
द्वारा: Lobel, Ilan, और अन्य
प्रकाशित: (2010) -
On the exact feasibility of convex scenario programs with discarded constraints
द्वारा: Romao, L, और अन्य
प्रकाशित: (2022) -
Distributed actuator selection: achieving optimality via a primal-dual algorithm
द्वारा: Romao, L, और अन्य
प्रकाशित: (2018)