arrow
Return

Accelerated Dual Averaging Methods for Decentralized Constrained Optimization

delete2023-04-01
delete0
delete
OA
AI
C
Changxin Liu
Y
Yang Shi *
H
Huiping Li
W
Wenli Du
DOI:10.1109/TAC.2022.3173062delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this article, we study decentralized convex constrained optimization problems in networks. We focus on the dual averaging-based algorithmic framework that is well-documented to be superior in handling constraints and complex communication environments simultaneously. Two new decentralized dual averaging (DDA) algorithms are proposed. In the first one, a second-order dynamic average consensus protocol is tailored for DDA-type algorithms, which equips each agent with a provably more accurate estimate of the global dual variable than conventional schemes. We rigorously prove that the proposed algorithm attains O( 1/t) convergence for general convex and smooth problems, for which existing DDA methods were only known to converge at O(1/v t) prior to our work. In the second one, we use the extrapolation technique to accelerate the convergence of DDA. Compared to existing accelerated algorithms, where typically two different variables are exchanged among agents at each time, the proposed algorithm only seeks consensus on local gradients. Then, the extrapolation is performed based on two sequences of primal variables, which are determined by the accumulations of gradients at two consecutive time instants, respectively. The algorithm is proved to converge at O(1) 1 t2 + 1 t(1-ss)2 , where ss denotes the second largest singular value of the mixing matrix. We remark that the condition for the algorithmic parameter to guarantee convergence does not rely on the spectrum of the mixing matrix, making itself easy to satisfy in practice. Finally, numerical results are presented to demonstrate the efficiency of the proposed methods.
Keywords:
Convergence
Optimization
Heuristic algorithms
Linear programming
Consensus protocol
Machine learning algorithms
Extrapolation
Acceleration
constrained optimization
decentralized optimization
dual averaging
multiagent system

Journal

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

U
University of Victoria
Scholars:
1.0W
Papers: 1.0W
Citations: 1.5W
N
Northwestern Polytechnical University
Scholars:
4.6W
Papers: 3.7W
Citations: 5.3W
Cited Papers

Cited Papers

Newton-Raphson Consensus for Distributed Convex Optimization
err2016-04-01
err166
errOAAI
errVaragnolo, Damiano; Zanella, Filippo; Cenedese, Angelo; Pillonetto, Gianluigi; Schenato, Luca
errShare
errSave
Enhancing the Silanization Reaction of the Silica-Silane System by Different Amines in Model and Practical Silica-Filled Natural Rubber Compounds
err2018-05-27
err0
errOAAI
errC. Hayichelaeh; L.A.E.M. Reuvekamp; W.K. Dierkes; A. Blume; J.W.M. Noordermeer; K. Sahakaro
errShare
errSave
Fast Distributed Gradient Methods
err2014-05-01
err463
errOAAI
errJakovetic, Dusan; Xavier, Joao; Moura, Jose M. F.
errShare
errSave
Decentralized Frank-Wolfe Algorithm for Convex and Nonconvex Problems
err2017-11-01
err73
errOAAI
errWai, Hoi-To; Lafond, Jean; Scaglione, Anna; Moulines, Eric
errShare
errSave
researcher View more