Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- An event-triggered quantization communication strategy for distributed optimal resource allocation
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Asynchronous Gossip-Based Random Projection Algorithms Over Networks
- Asynchronous Gradient Push
- Compressed gradient tracking for decentralized optimization over general directed networks
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Distributed Constrained Optimization Over Unbalanced Directed Networks Using Asynchronous Broadcast-Based Algorithm
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Optimization Over Time-Varying Graphs With Imperfect Sharing of Information
- Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\)
- Distributed constrained optimization for multi-agent networks with communication delays under time-varying topologies
- Distributed constrained optimization with periodic dynamic quantization
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Distributed dual averaging method for multi-agent optimization with quantized communication
- Distributed online bandit optimization under random quantization
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Distributed optimization of multi-integrator agent systems with mixed neighbor interactions
- Distributed resource allocation over random networks based on stochastic approximation
- Hybrid Nash Equilibrium Seeking Under Partial-Decision Information: An Adaptive Dynamic Event-Triggered Approach
- On Centralized and Distributed Mirror Descent: Convergence Analysis Using Quadratic Constraints
- Quantization Enabled Privacy Protection in Decentralized Stochastic Optimization
- Quantized Distributed Gradient Tracking Algorithm With Linear Convergence in Directed Networks
This page was built for publication: Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956859)
