Distributed Momentum-Based Multiagent Optimization With Different Constraint Sets
- 19 August 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 963-978
Abstract
In this article, we consider a class of consensus optimization problems over a time-varying communication network wherein each agent can only interact with its neighbors. The target is to minimize the summation of all local and possibly nonsmooth objectives in the presence of different constraint sets per agent. To achieve this goal, we propose a novel distributed heavy-ball algorithm that combines the subgradient tracking technique with a momentum term related to history information. This algorithm promotes the distributed application of existing centralized accelerated momentum methods, especially for constrained nonsmooth problems. Under certain assumptions and conditions on the step-size and momentum coefficient, the convergence and optimality of the proposed algorithm can be guaranteed through a rigorous theoretical analysis, and a convergence rate of $\mathcal {O}(\text {ln}k/ \sqrt{k})$ in objective value is also established. Simulations on an $\ell _{1}$-regularized logistic-regression problem show that the proposed algorithm can achieve faster convergence than existing related distributed algorithms, while a case study involving a building energy management problem further demonstrates its efficacy.Keywords
Funding Information
- National Natural Science Foundation of China (62373051, U22A2048)
- Beijing Natural Science Foundation of China (IS23063)
- Fundamental Research Funds for the Central Universities
This publication has 43 references indexed in Scilit:
- Tracking-ADMM for distributed constraint-coupled optimizationAutomatica, 2020
- A unitary distributed subgradient method for multi-agent optimization with different coupling sourcesAutomatica, 2020
- Distributed optimization over directed graphs with row stochasticity and constraint regularityAutomatica, 2019
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphsAutomatica, 2019
- Dual decomposition for multi-agent distributed optimization with coupling constraintsAutomatica, 2017
- Distributed Linear Programming Models in a Smart Grid2017
- Distributed multi-agent optimization subject to nonidentical constraints and communication delaysAutomatica, 2016
- Large-Scale Machine Learning with Stochastic Gradient Descent2010
- Discrete-time dynamic average consensusAutomatica, 2010
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964