Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata
Contributor : Giovanni Neglia Connect in order to contact the contributor
Submitted on : Friday, January 15, 2016 - 6:55:38 PM
Last modification on : Wednesday, February 2, 2022 - 3:55:43 PM

Links full text




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⟩



Record views