Unification and acceleration of distributed gradient methods for optimization over directed graphs
From MaRDI portal
Cites work
- A Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence
- Accelerated Distributed Nesterov Gradient Descent
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- ADD-OPT: Accelerated Distributed Directed Optimization
- Balancing Communication and Computation in Distributed Optimization
- Cloud K-SVD: A Collaborative Dictionary Learning Algorithm for Big, Distributed Data
- Constrained Consensus and Optimization in Multi-Agent Networks
- Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters
- DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
- DILAND: An Algorithm for Distributed Sensor Localization With Noisy Distance Measurements
- Discrete-time dynamic average consensus
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control
- Event-triggered simultaneous fault detection and tracking control for multi-agent systems
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast Distributed Gradient Methods
- Gossip-based computation of aggregate information
- Harnessing Smoothness to Accelerate Distributed Optimization
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
- Noise Reduction by Swarming in Social Foraging
- On the convergence of decentralized gradient descent
- On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation
- On the Convergence of Nested Decentralized Gradient Methods With Multiple Consensus and Gradient Steps
- Push–Pull Gradient Methods for Distributed Optimization in Networks
This page was built for publication: Unification and acceleration of distributed gradient methods for optimization over directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295454)