Distributed Multi-Step Subgradient Random Projection Algorithm Over Switching Graphs With Random Time Delay

Based on the multi-agent system model over switching network with random communication delay, we propose a distributed multi-step subgradient random projection algorithm and analyze the convergence and convergence rate of the proposed algorithm. The multi-step subgradient of agents is a combination of the subgradient at current time and all the historical sub gradient. Batch random projection is utilized in proposed algorithm to improve the accuracy of random projection. To simplify the process of convergence analysis we propose a method of system expansion to replace the random conununication delay. The final numerical simulation results show that the multi-step subgradient random projection algorithm has a faster convergence speed than the traditional subgradient algorithm.