Distributed Mirror Descent Algorithm with Bregman Damping for Nonsmooth Constrained Optimization
Optimization and Control
2021-08-30 v1
Abstract
To solve distributed optimization efficiently with various constraints and nonsmooth functions, we propose a distributed mirror descent algorithm with embedded Bregman damping, as a generalization of conventional distributed projection-based algorithms. In fact, our continuous-time algorithm well inherits good capabilities of mirror descent approaches to rapidly compute explicit solutions to the problems with some specific constraint structures. Moreover, we rigorously prove the convergence of our algorithm, along with the boundedness of the trajectory and the accuracy of the solution.
Cite
@article{arxiv.2108.12136,
title = {Distributed Mirror Descent Algorithm with Bregman Damping for Nonsmooth Constrained Optimization},
author = {Guanpu Chen and Weijian Li and Gehui Xu and Yiguang Hong},
journal= {arXiv preprint arXiv:2108.12136},
year = {2021}
}