Distributed strategies for generating weight-balanced and doubly stochastic digraphs

DOI10.3166/EJC.18.539-557zbMath1291.93290arXiv0911.0232OpenAlexW2963940890MaRDI QIDQ389827

Bahman Gharesifard, Jorge Cortés

Publication date: 21 January 2014

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0232

zbMATH Keywords

cooperative controlweight-balanced digraphsnetwork design and communicationdistributed dynamical systemsdoubly stochastic digraphsset-valued stability analysis

Mathematics Subject Classification ID

Decentralized systems (93A14) Stochastic systems in control theory (general) (93E03) Applications of graph theory to circuits and networks (94C15)

Related Items

Distributed event-triggered coordination for average consensus on weight-balanced digraphs, Distributed averaging with linear objective maps, Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions, Consensus-based distributed filtering with fusion step analysis, Convergence time of average consensus with heterogeneous random link failures, Average consensus on strongly connected weighted digraphs: a generalized error bound, Seeking strategy design for distributed nonsmooth games and its application, Distributed resource coordination in networked systems described by digraphs, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate, Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators, Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs, A distributed dynamics for virus-spread control, Distributed convergence to Nash equilibria in two-network zero-sum games, Event-triggered communication and control of networked systems for multi-agent consensus, A distributed algorithm for solving mixed equilibrium problems, Graph-balancing algorithms for average consensus over directed networks, Distributed decision-coupled constrained optimization via proximal-tracking, Distributed resource allocation via multi-agent systems under time-varying networks, Non-oscillating quantized average consensus over dynamic directed topologies, Robust discrete time dynamic average consensus, Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on algebraic connectivity via convex optimization
• From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Distributed algorithms for reaching consensus on general functions
• Virtual leader approach to coordinated control of multiple mobile agents with asymmetric interactions
• Fast linear iterations for distributed averaging
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• A new approach to the maximum-flow problem
• Algebraic Graph Theory
• Distributed Computing: A Locality-Sensitive Approach
• Consensus and Cooperation in Networked Multi-Agent Systems
• Distributed Subgradient Methods for Multi-Agent Optimization
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stable Flocking of Multiple Inertial Agents on Balanced Graphs
• On Distributed Convex Optimization Under Inequality and Equality Constraints
• Algebraic connectivity of directed graphs
• On a Class of Directed Graphs—With an Application to Traffic-Flow Problems