Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization

Abstract : In this work we study the weight optimization problem for average consensus protocols by reformulating it as a Schatten norm minimization with parameter p. We show that as p approaches infinity, the optimal solution of the Schatten norm induced problem recovers the optimal solution of the original problem. Moreover, by tuning the parameter p in our proposed minimization, we can simply trade-off the quality of the solution (i.e., the speed of convergence) for communication/computation requirements (in terms of number of messages exchanged and volume of data processed). We then propose a distributed algorithm to solve the Schatten norm minimization and we show that it outperforms the other distributed weight selection methods.
Type de document :
Article dans une revue
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2015, 60 (5), pp.1350-1355. 〈10.1109/TAC.2014.2352773〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01257175
Contributeur : Giovanni Neglia <>
Soumis le : vendredi 15 janvier 2016 - 18:55:38
Dernière modification le : samedi 27 janvier 2018 - 01:31:42

Identifiants

Collections

Citation

Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov. Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization. IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2015, 60 (5), pp.1350-1355. 〈10.1109/TAC.2014.2352773〉. 〈hal-01257175〉

Partager

Métriques

Consultations de la notice

182