DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
From MaRDI portal
Publication:4566895
Cited in
(16)- Distributed optimal coordination of multiple heterogeneous linear systems over unbalanced directed communication networks
- An accelerated exact distributed first-order algorithm for optimization over directed networks
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed object pose estimation over strongly connected networks
- Resilient consensus‐based distributed optimization under deception attacks
- A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization
- Optimal output consensus of second‐order uncertain nonlinear systems on weight‐unbalanced directed networks
- DEXTRA
- Distributed optimal coordination of uncertain nonlinear multi‐agent systems over unbalanced directed networks via output feedback
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- Optimal convergence rates for convex distributed optimization in networks
- A distributed accelerated algorithm based on a unified momentum method
- Balancing communication and computation in gradient tracking algorithms for decentralized optimization
- Projected subgradient based distributed convex optimization with transmission noises
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)