BibTex format
@unpublished{Bin:2020,
author = {Bin, M and Parisini, T},
title = {A distributed methodology for approximate uniform global minimum sharing},
url = {http://arxiv.org/abs/2012.08940v1},
year = {2020}
}
Publications
Citation
RIS format (EndNote, RefMan)
TY - UNPB
AB - The paper deals with the distributed minimum sharing problem, in which anetwork of decision-makers - exchanging information through a communicationnetwork - computes the minimum of some local quantities of interest in adistributed and decentralized way. The problem is equivalently cast into acost-coupled distributed optimization problem, and an adjustable approximate(or sub-optimal) solution is presented which enjoys several properties ofcrucial importance in applications. In particular, the proposed solution isscalable in that the dimension of the state space does not grow with the sizeor topology of the communication network. Moreover, a global and uniform (bothin the initial time and in the initial condition) asymptotic stability resultis provided, as well as an attractiveness property towards a steady state whichcan be made arbitrarily close to the sought minimum. Exact asymptoticconvergence is also recovered at the price, however, of loosing uniformity ofthe convergence with respect to the initial time.
AU - Bin,M
AU - Parisini,T
PY - 2020///
TI - A distributed methodology for approximate uniform global minimum sharing
UR - http://arxiv.org/abs/2012.08940v1
UR - http://hdl.handle.net/10044/1/85670
ER -