返回
Distributed Mirror Descent Algorithm With Bregman Damping for Nonsmooth Constrained Optimization
DOI:10.1109/TAC.2023.3244995.png)
摘要
En 中文
To efficiently solve the nonsmooth distributed optimization with both local constraints and coupled constraints, we propose a distributed continuous-time algorithm based on the mirror descent (MD) method. In this article, we introduce the Bregman damping into distributed MD-based dynamics, which not only successfully applies the MD idea to the distributed primal-dual framework, but also ensures the boundedness of all variables and the convergence of the entire dynamics. Our approach generalizes the classic distributed projection-based dynamics, and establishes a connection between MD methods and distributed Euclidean-projected approaches. Also, we prove the convergence of the proposed distributed dynamics with an O(1/t) rate. For practical implementation, we further give a discrete-time algorithm based on the proposed dynamics with an O(1/root k) convergence rate.
Keyword:
Constrained optimization
distributed algorithm
mirror descent
multi-agent system
nonsmooth.
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Developmental Progression to Infectivity in
Trypanosoma brucei
Triggered by an RNA-Binding Protein
Science
IF0
Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
AUTOMATICA
IF5.9
Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints求解一般约束凸优化问题的连续时间分布次梯度算法
Distributed Nonsmooth Optimization With Coupled Inequality Constraints via Modified Lagrangian Function基于修正拉格朗日函数的耦合不等式约束分布式非光滑优化

