DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
From MaRDI portal
Cited in
(23)- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Projected subgradient based distributed convex optimization with transmission noises
- DEXTRA
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Optimal convergence rates for convex distributed optimization in networks
- An accelerated exact distributed first-order algorithm for optimization over directed networks
- A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes
- Optimal output consensus of second‐order uncertain nonlinear systems on weight‐unbalanced directed networks
- Resilient consensus‐based distributed optimization under deception attacks
- Distributed optimal coordination of multiple heterogeneous linear systems over unbalanced directed communication networks
- Distributed object pose estimation over strongly connected networks
- Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization
- Distributed optimal coordination of uncertain nonlinear multi‐agent systems over unbalanced directed networks via output feedback
- A distributed accelerated algorithm based on a unified momentum method
- Balancing communication and computation in gradient tracking algorithms for decentralized optimization
- A distributed parallel optimization algorithm via alternating direction method of multipliers
- Differentially private dual gradient tracking for distributed resource allocation
- An adaptive gain-based fixed-time distributed algorithm for constrained optimization problems
- On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
- Exponential convergence rate of distributed optimisation for multi-agent systems with constraints set over a directed graph
- Convergence of an accelerated distributed optimisation algorithm over time-varying directed networks
- Privacy-preserving gradient tracking via state decomposition for directed multi-agent optimization
This page was built for publication: DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566895)
