Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs

DOI10.1109/TAC.2012.2219953MaRDI QIDQ5353142zbMATH OpenOpenAlexFDO

Authors Alejandro D. Domínguez-García, Christoforos N. Hadjicostis

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2012.2219953

Mathematics Subject Classification ID

Applications of graph theory (05C90) Decentralized systems (93A14) Discrete-time control/observation systems (93C55)

Cited in

(19)

• Multi-agent control: a graph-theoretic perspective
• Distributed average consensus in digraphs
• A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW)
• Distributed multi-agent optimisation via coordination with second-order nearest neighbours
• Invariant properties of linear-iterative distributed averaging algorithms and application to error detection
• Distributed stopping for average consensus in undirected graphs via event-triggered strategies
• Strong consensus of convex second-order multi-agent systems with time-varying topologies
• A distributed algorithm for average consensus on strongly connected weighted digraphs
• Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
• Performance and robustness of discrete and finite time average consensus algorithms
• Reprint of ``A distributed algorithm for efficiently solving linear equations and its applications (Special issue JCW)
• From Matrix-Weighted Consensus to Multipartite Average Consensus
• Finite-time median-related group consensus over directed networks
• Strong reciprocal ratio consensus of modified second-order multi-agent systems with periodically time-varying topologies
• Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
• Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
• A Unified Framework for Continuous-Time Unconstrained Distributed Optimization
• Graph-balancing algorithms for average consensus over directed networks
• A stochastic primal-dual method for optimization with conditional value at risk constraints

This page was built for publication: Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353142)