• Home
  • Search
  • AB/Push-Pull method for distributed optimization in time-varying directed networks
  • Open Access IconOpen Access
  • Cite Icon17
  • https://doi.org/10.1080/10556788.2023.2261602Copy DOI Icon

AB/Push-Pull method for distributed optimization in time-varying directed networks

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we study the distributed optimization problem for a system of agents embedded in time-varying directed communication networks. Each agent has its own cost function and agents cooperate to determine the global decision that minimizes the summation of all individual cost functions. We consider the so-called push-pull gradient-based algorithm (termed as AB/Push-Pull) which employs both row- and column-stochastic weights simultaneously to track the optimal decision and the gradient of the global cost while ensuring consensus and optimality. We show that the algorithm converges linearly to the optimal solution over a time-varying directed network for a constant stepsize when the agent's cost function is smooth and strongly convex. The linear convergence of the method has been shown in [F. Saadatniaki, R. Xin, and U.A. Khan, Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices, IEEE Trans. Autom. Control 65(11) (2020), pp. 4769–4780], where the multi-step consensus contraction parameters for row- and column-stochastic mixing matrices are not directly related to the underlying graph structure, and the explicit range for the stepsize value is not provided. With respect to [F. Saadatniaki, R. Xin, and U.A. Khan, Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices, IEEE Trans. Autom. Control 65(11) (2020), pp. 4769–4780], the novelty of this work is twofold: (1) we establish the one-step consensus contraction for both row- and column-stochastic mixing matrices with the contraction parameters given explicitly in terms of the graph diameter and other graph properties; and (2) we provide explicit upper bounds for the stepsize value in terms of the properties of the cost functions, the mixing matrices, and the graph connectivity structure.

Similar Papers
  • Conference Article
  • Citations1

Necessary and sufficient condition of consensus for affine multi-agent cooperative systems under time-varying directed networks

  • Jun 01, 2013
  • Jidong Jin +1
  • Research Article

时变有向网络下仿射多个体系统的状态一致性

  • Oct 01, 2013
  • SCIENTIA SINICA Informationis
  • Yufan Zheng +1
  • Research Article
  • Citations14

Distributed real-time power management of high-penetrated PV sources with voltage regulation over time-varying networks

  • Mar 20, 2021
  • International Journal of Electrical Power & Energy Systems
  • Wenfa Kang +3
  • Research Article
  • Citations2

Privacy-enhanced microgrid operations: State decomposition for distributed economic dispatch over time-varying directed networks

  • Nov 01, 2025
  • Electric Power Systems Research
  • Keng Xu +2
  • Research Article
  • Citations15

Asynchronous Algorithms for Decentralized Resource Allocation Over Directed Networks

  • Jan 01, 2023
  • IEEE Transactions on Parallel and Distributed Systems
  • Qingguo Lu +3
  • Research Article
  • Citations1

Contracting with private rewards

  • Jun 01, 2020
  • The RAND Journal of Economics
  • René Kirkegaard
  • Conference Article
  • Citations2

A distributed optimization method to resource allocation problem on directed communication network under time delays

  • May 05, 2020
  • Xiao Wang +5
  • Research Article

Dynamic Regret of Quantized Distributed Online Bandit Optimization in Zero-Sum Games.

  • Jan 01, 2026
  • IEEE transactions on cybernetics
  • Lan Liao +5
  • Book Chapter

Properties of cost and profit functions

  • Jan 01, 1991
  • Peter Berck +1
  • Single Book
  • Citations11

Optimization of Temporal Networks under Uncertainty

  • Jan 01, 2012
  • Wolfram Wiesemann
  • Research Article

On Riemannian and non-Riemannian Optimisation, and Optimisation Geometry

  • Jan 01, 2021
  • IFAC-PapersOnLine
  • Jeanne Lefevre +4
  • Book Chapter

Privacy Preserving Algorithms for Distributed Online Learning

  • Nov 16, 2022
  • Qingguo Lü +4
  • Research Article
  • Citations85

Fully Distributed Nash Equilibrium Seeking Over Time-Varying Communication Networks With Linear Convergence Rate

  • Apr 01, 2021
  • IEEE Control Systems Letters
  • Mattia Bianchi +1
  • Book Chapter
  • Citations28

Distributed Bregman-Distance Algorithms for Min-Max Optimization

  • Jan 01, 2013
  • Kunal Srivastava +2
  • Research Article
  • Citations78

Fixed-Time Nash Equilibrium Seeking in Time-Varying Networks

  • Apr 01, 2023
  • IEEE Transactions on Automatic Control
  • Jorge I Poveda +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.