eprintid: 2480
rev_number: 10
eprint_status: archive
userid: 6
dir: disk0/00/00/24/80
datestamp: 2015-01-13 15:04:49
lastmod: 2015-02-18 12:06:10
status_changed: 2015-01-13 15:04:49
type: book_section
metadata_visibility: show
creators_name: Gnecco, Giorgio
creators_name: Morisi, Rita
creators_name: Bemporad, Alberto
creators_id: giorgio.gnecco@imtlucca.it
creators_id: rita.morisi@imtlucca.it
creators_id: alberto.bemporad@imtlucca.it
title: Sparse solutions to the average consensus problem via L1-Norm regularization of the fastest mixing Markov-Chain problem
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
pres_type: paper
keywords: Optimization, Sensor networks, Linear systems
note: 53rd Annual Conference on Decision and Control (CDC), held in Los Angeles (USA) 15-17 December 2014 
abstract: In the “consensus problem” on multi-agent systems, in which the states of the agents are “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 so as 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 l1-norm regularized versions of the well-known fastest mixing Markov-chain problem, which are investigated theoretically. In particular, it is shown that such versions can be interpreted as “robust” forms of the fastest mixing Markov-chain problem. Theoretical results useful to guide the choice of the regularization parameters are also provided, together with a numerical example.
date: 2014-12
publisher: IEEE
pagerange: 2228-2233
event_title: 53rd IEEE Conference on Decision and Control
event_location: Los Angeles (USA)
event_dates: 15-17 December 2014
event_type: conference
id_number: 10.1109/CDC.2014.7039729
refereed: TRUE
isbn: 978-1-4799-7746-8 
book_title: Proceedings of the 53rd Annual Conference on Decision and Control (CDC)
official_url: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7039729&isnumber=7039338
citation:   Gnecco, Giorgio and Morisi, Rita and Bemporad, Alberto  Sparse solutions to the average consensus problem via L1-Norm regularization of the fastest mixing Markov-Chain problem.   In:  Proceedings of the 53rd Annual Conference on Decision and Control (CDC).   IEEE, pp. 2228-2233.  ISBN 978-1-4799-7746-8       (2014)