Geodesic
Distributed dual averaging algorithm for multi-agent optimization with coupled constraints
Kybernetika, Tome 60 (2024) no. 4, pp. 427-445 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

This paper investigates a distributed algorithm for the multi-agent constrained optimization problem, which is to minimize a global objective function formed by a sum of local convex (possibly nonsmooth) functions under both coupled inequality and affine equality constraints. By introducing auxiliary variables, we decouple the constraints and transform the multi-agent optimization problem into a variational inequality problem with a set-valued monotone mapping. We propose a distributed dual averaging algorithm to find the weak solutions of the variational inequality problem with an $O(1/\sqrt{k})$ convergence rate, where $k$ is the number of iterations. Moreover, we show that weak solutions are also strong solutions that match the optimal primal-dual solutions to the considered optimization problem. A numerical example is given for illustration.
This paper investigates a distributed algorithm for the multi-agent constrained optimization problem, which is to minimize a global objective function formed by a sum of local convex (possibly nonsmooth) functions under both coupled inequality and affine equality constraints. By introducing auxiliary variables, we decouple the constraints and transform the multi-agent optimization problem into a variational inequality problem with a set-valued monotone mapping. We propose a distributed dual averaging algorithm to find the weak solutions of the variational inequality problem with an $O(1/\sqrt{k})$ convergence rate, where $k$ is the number of iterations. Moreover, we show that weak solutions are also strong solutions that match the optimal primal-dual solutions to the considered optimization problem. A numerical example is given for illustration.
DOI : 10.14736/kyb-2024-4-0427
Classification : 68W15, 90C33
Keywords: distributed optimization; coupled constraints; dual averaging; variational inequality; multi-agent networks 
@article{10_14736_kyb_2024_4_0427,
     author = {Tu, Zhipeng and Liang, Shu},
     title = {Distributed dual averaging algorithm for multi-agent optimization with coupled constraints},
     journal = {Kybernetika},
     pages = {427--445},
     year = {2024},
     volume = {60},
     number = {4},
     doi = {10.14736/kyb-2024-4-0427},
     mrnumber = {4811982},
     zbl = {07953738},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0427/}
}
TY  - JOUR
AU  - Tu, Zhipeng
AU  - Liang, Shu
TI  - Distributed dual averaging algorithm for multi-agent optimization with coupled constraints
JO  - Kybernetika
PY  - 2024
SP  - 427
EP  - 445
VL  - 60
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0427/
DO  - 10.14736/kyb-2024-4-0427
LA  - en
ID  - 10_14736_kyb_2024_4_0427
ER  - 
%0 Journal Article
%A Tu, Zhipeng
%A Liang, Shu
%T Distributed dual averaging algorithm for multi-agent optimization with coupled constraints
%J Kybernetika
%D 2024
%P 427-445
%V 60
%N 4
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2024-4-0427/
%R 10.14736/kyb-2024-4-0427
%G en
%F 10_14736_kyb_2024_4_0427
Tu, Zhipeng; Liang, Shu. Distributed dual averaging algorithm for multi-agent optimization with coupled constraints. Kybernetika, Tome 60 (2024) no. 4, pp. 427-445. doi: 10.14736/kyb-2024-4-0427

Cité par Sources :