Distributed discrete-time optimization algorithms with application to resource allocation in epidemics control

Eduardo Ramírez-Llanos and Sonia Martínez
Optimal Control Applications and Methods, DOI: 10.1002/oca.2340

Abstract:

This work presents and analyzes two novel distributed discrete-time nonlinear algorithms to solve a class of decentralized resource allocation problems. The algorithms allow an interconnected group of agents to collectively minimize a global cost function under inequality and equality constraints. Under some technical conditions, it is shown that the first proposed algorithm converges asymptotically to the desired equilibrium, while the second one converges to the solution in a practical way as long as the stepsize chosen is sufficiently small. Of particular interest is that the algorithms are designed to be robust to temporary errors in communication or computation. In addition, agents do not require global knowledge of total resources in the network or any specific procedure for initialization. The convergence of the algorithms is established via second-order convexity theory together with nonsmooth Lyapunov analysis. Finally, we illustrate the applicability of our strategies on a virus mitigation problem over computer and human networks.

File: (local copy)

Bib-tex entry:

@article{ER-SM:18-ocam,
author = {E. Ram{\'\i}rez-Llanos and S. Mart{\'\i}nez},
title = {Distributed discrete-time optimization algorithms with application to resource allocation in epidemics control},
journal= {Optimal Control Applications and Methods},
year = {2018},
volume = {39},
number = {1},
pages = {160--180},
note = {DOI: 10.1002/oca.2340}
}