Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
From MaRDI portal
Cited in
(41)- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- Parallel alternating direction method of multipliers
- Distributed decision-coupled constrained optimization via proximal-tracking
- Fully asynchronous policy evaluation in distributed reinforcement learning over networks
- Surplus-based accelerated algorithms for distributed optimization over directed networks
- Triggered gradient tracking for asynchronous distributed optimization
- Gradient-free distributed optimization with exact convergence
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- Tracking-ADMM for distributed constraint-coupled optimization
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
- Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes
- Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis
- Multitask Diffusion Adaptation Over<?Pub _newline ?>Asynchronous Networks
- Asynchronous Distributed Optimization Over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
- On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation
- Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- scientific article; zbMATH DE number 7306853 (Why is no real title available?)
- The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning
- A resilient distributed optimization strategy against false data injection attacks
- Distributed continuous‐time constrained convex optimization with general time‐varying cost functions
- S-NEAR-DGD: A Flexible Distributed Stochastic Gradient Method for Inexact Communication
- Distributed convex optimization as a tool for solving \(f\)-consensus problems
- DIMIX: Diminishing Mixing for Sloppy Agents
- Dynamics based privacy preservation in decentralized optimization
- Gradient-tracking based differentially private distributed optimization with enhanced optimization accuracy
- Synchronous distributed ADMM for consensus convex optimization problems with self-loops
- Cooperative distributed extremum seeking control for coupled multiagent systems based on distributed identification-gradient tracking
- Sampled-data-based disturbance compensation distributed optimization control for a class of multi-agent systems
- Distributed event-triggered algorithm for unconstrained convex optimisation over weight-balanced directed networks
- Optimal gradient tracking for decentralized optimization
- A distributed parallel optimization algorithm via alternating direction method of multipliers
- AB /Push-Pull method for distributed optimization in time-varying directed networks
- Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
- Differentially private and communication-efficient distributed nonconvex optimization algorithms
- Compressed gradient tracking algorithms for distributed nonconvex optimization
- Linear convergence of event-triggered distributed optimization with metric subregularity condition
- Decentralized sparse linear regression via gradient-tracking
This page was built for publication: Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567086)
