
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
