DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
From MaRDI portal
Publication:4566895
DOI10.1109/TAC.2017.2672698zbMath1390.90553OpenAlexW2590635385MaRDI QIDQ4566895
Publication date: 27 June 2018
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2017.2672698
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Distributed algorithms (68W15)
Related Items (14)
Optimal Algorithms for Non-Smooth Distributed Optimization in Networks ⋮ Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions ⋮ Convergence rate analysis of distributed optimization with projected subgradient algorithm ⋮ 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 ⋮ Distributed optimization over directed graphs with row stochasticity and constraint regularity ⋮ DEXTRA ⋮ Projected subgradient based distributed convex optimization with transmission noises
This page was built for publication: DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
