Distributed stochastic mirror descent algorithm for resource allocation problem

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.

[1]  Feng Liu,et al.  Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems , 2015, Autom..

[2]  Wei Shi,et al.  Improved Convergence Rates for Distributed Resource Allocation , 2017, 2018 IEEE Conference on Decision and Control (CDC).

[3]  Shu Liang,et al.  Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity , 2019, Autom..

[4]  Hao Zhang,et al.  A distributed stochastic gradient algorithm for economic dispatch over directed network with communication delays , 2019, International Journal of Electrical Power & Energy Systems.

[5]  Angelia Nedic,et al.  Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization , 2008, J. Optim. Theory Appl..

[6]  Yiguang Hong,et al.  Distributed Algorithm for Robust Resource Allocation with Polyhedral Uncertain Allocation Parameters , 2018, J. Syst. Sci. Complex..

[7]  Yiguang Hong,et al.  Distributed resource allocation over random networks based on stochastic approximation , 2015, Syst. Control. Lett..

[8]  Yi Zhou,et al.  Communication-efficient algorithms for decentralized and stochastic optimization , 2017, Mathematical Programming.

[9]  Daniel W. C. Ho,et al.  Optimal distributed stochastic mirror descent for strongly convex optimization , 2016, Autom..

[10]  Jong-Shi Pang,et al.  On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games , 2020, Math. Oper. Res..

[11]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .

[12]  Yiguang Hong,et al.  Distributed regression estimation with incomplete data in multi-agent networks , 2018, Science China Information Sciences.

[13]  Ashish Cherukuri,et al.  Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch , 2015, IEEE Transactions on Control of Network Systems.

[14]  Daniela Pucci de Farias,et al.  Decentralized Resource Allocation in Dynamic Networks of Agents , 2008, SIAM J. Optim..