Projected Push-Pull For Distributed Constrained Optimization Over Time-Varying Directed Graphs (extended version) (2310.06223v1)
Abstract: We introduce the Projected Push-Pull algorithm that enables multiple agents to solve a distributed constrained optimization problem with private cost functions and global constraints, in a collaborative manner. Our algorithm employs projected gradient descent to deal with constraints and a lazy update rule to control the trade-off between the consensus and optimization steps in the protocol. We prove that our algorithm achieves geometric convergence over time-varying directed graphs while ensuring that the decision variable always stays within the constraint set. We derive explicit bounds for step sizes that guarantee geometric convergence based on the strong-convexity and smoothness of cost functions, and graph properties. Moreover, we provide additional theoretical results on the usefulness of lazy updates, revealing the challenges in the analysis of any gradient tracking method that uses projection operators in a distributed constrained optimization setting. We validate our theoretical results with numerical studies over different graph types, showing that our algorithm achieves geometric convergence empirically.
- A. Nedić and J. Liu, “Distributed optimization for control,” Annual Review of Control, Robotics, and Autonomous Systems, vol. 1, no. 1, pp. 77–103, 2018.
- G. Carnevale, A. Camisa, and G. Notarstefano, “Distributed online aggregative optimization for dynamic multirobot coordination,” IEEE Transactions on Automatic Control, vol. 68, no. 6, pp. 3736–3743, 2023.
- S. S. Ram, V. V. Veeravalli, and A. Nedic, “Distributed and recursive parameter estimation in parametrized linear state-space models,” IEEE Transactions on Automatic Control, vol. 55, no. 2, pp. 488–492, 2010.
- G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,” in 2016 IEEE 55th Conference on Decision and Control (CDC), 2016, pp. 159–166.
- ——, “Harnessing smoothness to accelerate distributed optimization,” IEEE Transactions on Control of Network Systems, vol. 5, no. 3, pp. 1245–1260, 2018.
- J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,” in 2015 54th IEEE Conference on Decision and Control (CDC). IEEE, 2015, pp. 2055–2060.
- A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization, vol. 27, no. 4, pp. 2597–2633, 2017.
- C. Xi, V. S. Mai, R. Xin, E. H. Abed, and U. A. Khan, “Linear convergence in optimization over directed graphs with row-stochastic matrices,” IEEE Transactions on Automatic Control, vol. 63, no. 10, pp. 3558–3565, 2018.
- R. Xin and U. A. Khan, “A linear algorithm for optimization over directed graphs with geometric convergence,” IEEE Control Systems Letters, vol. 2, no. 3, pp. 315–320, 2018.
- S. Pu, W. Shi, J. Xu, and A. Nedić, “Push–pull gradient methods for distributed optimization in networks,” IEEE Transactions on Automatic Control, vol. 66, no. 1, pp. 1–16, 2021.
- F. Saadatniaki, R. Xin, and U. A. Khan, “Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices,” IEEE Transactions on Automatic Control, vol. 65, no. 11, pp. 4769–4780, 2020.
- A. Nedić, D. T. A. Nguyen, and D. T. Nguyen, “Ab/push-pull method for distributed optimization in time-varying directed networks,” arXiv preprint arXiv:2209.06974, 2022.
- H. Liu, W. Yu, and G. Chen, “Discrete-time algorithms for distributed constrained convex optimization with linear convergence rates,” IEEE Transactions on Cybernetics, vol. 52, no. 6, pp. 4874–4885, 2020.
- M. Luan, G. Wen, H. Liu, T. Huang, G. Chen, and W. Yu, “Distributed discrete-time convex optimization with closed convex set constraints: Linearly convergent algorithm design,” IEEE Transactions on Cybernetics, pp. 1–13, 2023.
- X. Meng, Q. Liu, and J. Xiong, “An accelerated gradient tracking algorithm with projection error for distributed optimization,” in 2023 15th International Conference on Advanced Computational Intelligence (ICACI), 2023, pp. 1–6.
- D. T. A. Nguyen, D. T. Nguyen, and A. Nedić, “Distributed nash equilibrium seeking over time-varying directed communication networks,” arXiv preprint arXiv:2201.02323, 2022.
- S. Bubeck et al., “Convex optimization: Algorithms and complexity,” Foundations and Trends® in Machine Learning, vol. 8, no. 3-4, pp. 231–357, 2015.