Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps

Previous papers have proposed to add memory registers to the dynamics of discrete-time linear systems in order to accelerate their convergence. In particular, it has been proved that adding one memory slot per agent allows faster convergence towards average consensus. We here prove that this situation cannot be improved by adding more memory slots, when the knowledge about the self-adjoint linear map to be accelerated reduces to bounds on its extreme eigenvalues.

[1]  Christopher V. Hollot,et al.  Some discrete-time counterparts to Kharitonov's stability criterion for uncertain systems , 1986 .

[2]  Kyomin Jung,et al.  Distributed Averaging Via Lifted Markov Chains , 2009, IEEE Transactions on Information Theory.

[3]  Leonidas Georgopoulos,et al.  Definitive Consensus for Distributed Data Inference , 2011 .

[4]  W. Evans Control system synthesis by Root Locus method , 1950, Electrical Engineering.

[5]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

[6]  Naresh K. Sinha,et al.  Control Systems , 1986 .

[7]  B. Barmish A Generalization of Kharitonov's Four Polynomial Concept for Robust Stability Problems with Linearly Dependent Coefficient Perturbations , 1988, 1988 American Control Conference.

[8]  Pascal Frossard,et al.  Polynomial Filtering for Fast Convergence in Distributed Consensus , 2008, IEEE Transactions on Signal Processing.

[9]  Raphaël M. Jungers,et al.  Graph diameter, eigenvalues, and minimum-time consensus , 2012, Autom..

[10]  P. P. Vaidyanathan,et al.  Derivation of new and existing discrete-time Kharitonov theorems based on discrete-time reactances [digital signal processing] , 1990, IEEE Trans. Acoust. Speech Signal Process..

[11]  Brian D. O. Anderson,et al.  Analysis of accelerated gossip algorithms , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[12]  Kyomin Jung,et al.  Fast and Slim Lifted Markov Chains , 2008 .

[13]  Fang Chen,et al.  Lifting Markov chains to speed up mixing , 1999, STOC '99.

[14]  Carlos Sagüés,et al.  Chebyshev Polynomials in Distributed Consensus Applications , 2011, IEEE Transactions on Signal Processing.

[15]  S. Muthukrishnan,et al.  First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing , 1996, Theory of Computing Systems.

[16]  Euhanna Ghadimi,et al.  Accelerated gradient methods for networked optimization , 2011, Proceedings of the 2011 American Control Conference.

[17]  M. Johansson,et al.  Faster Linear Iterations for Distributed Averaging , 2008 .

[18]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[19]  Alex Olshevsky,et al.  Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control , 2014, 1411.4186.

[20]  João Pedro Hespanha,et al.  Mistuning-Based Control Design to Improve Closed-Loop Stability Margin of Vehicular Platoons , 2008, IEEE Transactions on Automatic Control.

[21]  Y. Nesterov A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .