Convergence of random sleep algorithms for optimal consensus
From MaRDI portal
(Redirected from Publication:2437791)
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
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3919670 (Why is no real title available?)
- scientific article; zbMATH DE number 1076783 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Agreement over random networks
- Connectivity and Set Tracking of Multi-Agent Systems Guided by Multiple Moving Leaders
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Constrained Consensus and Optimization in Multi-Agent Networks
- Controlled Hopwise Averaging and Its Convergence Rate
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
- Distributed Estimation of Channel Gains in Wireless Sensor Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Flocking in Fixed and Switching Networks
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologies
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Randomized optimal consensus of multi-agent systems
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Robust consensus and soft control of multi-agent systems with noises
- State Constraints in Convex Control Problems of Bolza
- Target containment control of multi-agent systems with random switching interconnection topologies
- The method of projections for finding the common point of convex sets
- Theory of Reproducing Kernels
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)
