relation: http://eprints.imtlucca.it/2774/
title: Sparse Solutions to the Average Consensus Problem via Various Regularizations of the Fastest Mixing Markov-Chain Problem
creator: Gnecco, Giorgio
creator: Morisi, Rita
creator: Bemporad, Alberto
subject: QA Mathematics
subject: QA75 Electronic computers. Computer science
subject: T Technology (General)
description: In the consensus problem on multi-agent systems, in which the states of the agents represent opinions, the agents aim at reaching a common opinion (or consensus state) through local exchange of information. An important design problem is to choose the degree of interconnection of the subsystems to achieve a good trade-off between a small number of interconnections and a fast convergence to the consensus state, which is the average of the initial opinions under mild conditions. This paper addresses this problem through l₁ -norm and l₀ -“pseudo-norm” regularized versions of the well-known Fastest Mixing Markov-Chain (FMMC) problem. We show that such versions can be interpreted as robust forms of the FMMC problem and provide results to guide the choice of the regularization parameter.
publisher: IEEE
date: 2015-07
type: Article
type: PeerReviewed
identifier:   Gnecco, Giorgio and Morisi, Rita and Bemporad, Alberto  Sparse Solutions to the Average Consensus Problem via Various Regularizations of the Fastest Mixing Markov-Chain Problem.  IEEE Transactions on Network Science and Engineering, 2 (3).  pp. 97-111.  ISSN 2327-4697      (2015)  
relation: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=7268908&filter%3DAND(p_IS_Number%3A7295693)
relation: 10.1109/TNSE.2015.2479086