.png){kind=icon}
返回
Gossip-based distributed stochastic mirror descent for constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2024.106291.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a distributed constrained optimization problem over a multi -agent network in the nonEuclidean sense. The gossip protocol is adopted to relieve the communication burden, which also adapts to the constantly changing topology of the network. Based on this idea, a gossip -based distributed stochastic mirror descent (GB-DSMD) algorithm is proposed to handle the problem under consideration. The performances of GB-DSMD algorithms with constant and diminishing step sizes are analyzed, respectively. When the step size is constant, the error bound between the optimal function value and the expected function value corresponding to the average iteration output of the algorithm is derived. While for the case of the diminishing step size, it is proved that the output of the algorithm uniformly approaches to the optimal value with probability 1. Finally, as a numerical example, the distributed logistic regression is reported to demonstrate the effectiveness of the GB-DSMD algorithm.
Keyword:
Stochastic mirror descent
Distributed constrained optimization
Distributed convex optimization
Gossip algorithm
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
暂无机构信息
引用论文
Distributed parameter estimation in unreliable sensor networks via broadcast gossip algorithms.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏Two-timescale recurrent neural networks for distributed minimax optimizationNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏Hybrid distributed finite-time neurodynamic optimization of electric vehicle charging schemes management in microgrid considering time-varying factorsNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏A generalized neural network for distributed nonsmooth optimization with inequality constraintNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容