Asynchronous Distributed Nonsmooth Composite Optimization via Computation-Efficient Primal-Dual Proximal Algorithms
- 9 August 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 9 (2) , 1595-1609
Abstract
This paper focuses on a distributed nonsmooth composite optimization problem over a multiagent networked system, in which each agent is equipped with a local Lipschitz-differentiable function and two possibly nonsmooth functions, one of which incorporates a linear mapping. To address this problem, we introduce a synchronous distributed algorithm featuring uncoordinated relaxed factors. It serves as a generalized relaxed version of the recent method TriPD-Dist. Notably, the considered problem in the presence of asynchrony and delays remains relatively unexplored. In response, a new asynchronous distributed primal-dual proximal algorithm is first proposed, rooted in a comprehensive asynchronous model. It is operated under the assumption that agents utilize possibly outdated information from their neighbors, while considering arbitrary, time-varying, yet bounded delays. With some special adjustments, new asynchronous distributed extensions of existing centralized methods are obtained via the proposed asynchronous algorithm. Theoretically, a new convergence analysis technique of the proposed algorithms is provided. Specifically, a sublinear convergence rate is explicitly derived by showcasing that the iteration behaves as a nonexpansive operator. In addition, the proposed asynchronous algorithm converges the optimal solution in expectation under the same step-size conditions as its synchronous counterpart. Finally, numerical studies substantiate the efficacy of the proposed algorithms and validate their performance in practical scenarios.Keywords
Funding Information
- Fundamental Research Funds for the Central Universities (SWU-XDJH202312)
- National Natural Science Foundation of China (62173278)
- Graduate Research and Innovation Project of Southwest University (SWUB23074)
This publication has 55 references indexed in Scilit:
- Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variablesJournal of the Franklin Institute, 2020
- A Three-Operator Splitting Scheme and its Optimization ApplicationsSet-Valued and Variational Analysis, 2017
- Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operatorsComputational Optimization and Applications, 2017
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systemsSystems & Control Letters, 2015
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problemsAdvances in Computational Mathematics, 2015
- A splitting method for separable convex programmingIMA Journal of Numerical Analysis, 2014
- A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite TermsJournal of Optimization Theory and Applications, 2012
- A splitting algorithm for dual monotone inclusions involving cocoercive operatorsAdvances in Computational Mathematics, 2011
- Convex Analysis and Monotone Operator Theory in Hilbert Spaces2011
- Distributed Stochastic Subgradient Projection Algorithms for Convex OptimizationJournal of Optimization Theory and Applications, 2010