Optimization of Distributed ADMM Algorithm Based on Minimum Network Latency

In order to solve the problem that the running speed of distributed ADMM algorithm is limited by the nodes with large network latency, a master node selection policy is proposed, which is based on the communication delay between network nodes, and the policy aims to reduce the running time of distri...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the International Symposium on Computational Intelligence and Design pp. 7 - 10
Main Authors: Zeng, Shuai, Wang, Shuangsheng, Zhang, Yi
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2019
Subjects:
ADMM
algorithm optimizartion
Clustering algorithms
Convergence
Delays
Linear programming
machine learning
Machine learning algorithms
network latency
Optimization
Signal processing algorithms
ISSN:2473-3547
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to solve the problem that the running speed of distributed ADMM algorithm is limited by the nodes with large network latency, a master node selection policy is proposed, which is based on the communication delay between network nodes, and the policy aims to reduce the running time of distributed ADMM algorithm in the connected network. Experiment results show that the policy can effectively reduce the running time of distributed ADMM algorithm in connected networks, and the calculation accuracy is not affected. And the smaller the connection probability between network nodes, the more significant the advantages of the proposed policy are. And when there is a communication failure between a few nodes in the connected network, the strategy proposed in this paper is not affected much.
ISSN:2473-3547
DOI:10.1109/ISCID.2019.10084