Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices

DOI10.1109/TAC.2018.2797164zbMath1423.90192arXiv1611.06160OpenAlexW2964103300MaRDI QIDQ4562301

Eyad H. Abed, Usman A. Khan, Chenguang Xi, Van Sy Mai, Ran Xin

Publication date: 19 December 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.06160

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (17)

Distributed adaptive Newton methods with global superlinear convergence ⋮ Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation ⋮ Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs ⋮ Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique ⋮ An accelerated exact distributed first-order algorithm for optimization over directed networks ⋮ A stochastic averaging gradient algorithm with multi‐step communication for distributed optimization ⋮ Optimal output consensus of second‐order uncertain nonlinear systems on weight‐unbalanced directed networks ⋮ Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network ⋮ Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management ⋮ Linear convergence of distributed estimation with constraints and communication delays ⋮ Distributed object pose estimation over strongly connected networks ⋮ Distributed optimization over directed graphs with row stochasticity and constraint regularity ⋮ An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network ⋮ Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method ⋮ An accelerated distributed gradient method with local memory ⋮ Distributed dynamic event-triggered algorithm with positive minimum inter-event time for convex optimisation problem ⋮ Distributed dynamic event-triggered algorithm with minimum inter-event time for multi-agent convex optimisation

This page was built for publication: Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices