Convergence of random sleep algorithms for optimal consensus
From MaRDI portal
Publication:2437791
DOI10.1016/J.SYSCONLE.2013.10.001zbMATH Open1282.93019DBLPjournals/scl/LouSJH13OpenAlexW2163011776WikidataQ60432155 ScholiaQ60432155MaRDI QIDQ2437791FDOQ2437791
Authors: Youcheng Lou, Karl Henrik Johansson, Yiguang Hong, Guodong Shi 
Publication date: 13 March 2014
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2013.10.001
Recommendations
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Multi-cluster distributed optimization via random sleep strategy
- Randomized optimal consensus of multi-agent systems
- Randomized optimal consensus of multiagent systems based on a novel intermittent projected subgradient algorithm
- Interval consensus over random networks
Cites Work
- Title not available (Why is that?)
- Theory of Reproducing Kernels
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Target containment control of multi-agent systems with random switching interconnection topologies
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- Constrained Consensus and Optimization in Multi-Agent Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Agreement over random networks
- Flocking in Fixed and Switching Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Subgradient Methods for Multi-Agent Optimization
- The method of projections for finding the common point of convex sets
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Randomized optimal consensus of multi-agent systems
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- State Constraints in Convex Control Problems of Bolza
- Incremental subgradient methods for nondifferentiable optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Connectivity and Set Tracking of Multi-Agent Systems Guided by Multiple Moving Leaders
- Robust consensus and soft control of multi-agent systems with noises
- Incremental stochastic subgradient algorithms for convex optimization
- Distributed Estimation of Channel Gains in Wireless Sensor Networks
- Controlled Hopwise Averaging and Its Convergence Rate
Cited In (9)
- Order-Optimal Consensus Through Randomized Path Averaging
- Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Multi-cluster distributed optimization via random sleep strategy
- Mean Square Convergence of Consensus Algorithms in Random WSNs
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Almost sure exponential convergence to consensus of random gossip algorithms
- Aggregation in intersection region for distributed heterogeneous mobile sensor networks
- Consensus convergence with stochastic effects
This page was built for publication: Convergence of random sleep algorithms for optimal consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437791)
