Name
Abstract | ||
|---|---|---|
In this work we study the weight optimization problem for average consensus protocols by reformulating it as a Schatten norm minimization with parameter . We show that as approaches infinity, the optimal solution of the Schatten norm induced problem recovers the optimal solution of the original problem. Moreover, by tuning the parameter 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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TAC.2014.2352773 | Automatic Control, IEEE Transactions |
Keywords | Field | DocType |
Minimization,Convergence,Eigenvalues and eigenfunctions,Protocols,Symmetric matrices,Optimization,Vectors | Convergence (routing),Mathematical optimization,Schatten norm,Symmetric matrix,Minification,Minimisation (psychology),Distributed algorithm,Optimization problem,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
60 | 5 | 0018-9286 |
Citations | PageRank | References |
3 | 0.41 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahmoud El Chamie | 1 | 18 | 2.45 |
| Giovanni Neglia | 2 | 781 | 63.67 |
| Konstantin Avrachenkov | 3 | 1250 | 126.17 |