摘要
In this paper,we consider a distributed resource allocation problem of minimizing a global convex function formed by a sum of local convex functions with coupling constraints.Based on neighbor communication and stochastic gradient,a distributed stochastic mirror descent algorithm is designed for the distributed resource allocation problem.Sublinear convergence to an optimal solution of the proposed algorithm is given when the second moments of the gradient noises are summable.A numerical example is also given to illustrate the effectiveness of the proposed algorithm.
基金
the National Key Research and Development Program of China(No.2016YFB0901900)
the National Natural Science Foundation of China(No.61733018)
the China Special Postdoctoral Science Foundation Funded Project(No.Y990075G21).
