.png){kind=icon}
Return
Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2018.04.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the augmented Lagrange (AL) algorithm for distributed optimization is studied. Compared with the existing results, this paper uses different techniques, including the factorization of weighted Laplacian and the spectral decomposition technique, to prove the linear convergence of the AL algorithm, and simultaneously provides a novel description on the convergence rate. First, by using an important factorization of weighted Laplacian, it is proved that the linear convergence of the AL algorithm can be achieved via a simplified analysis procedure. Within this framework, a novel quantitative description on the convergence rate is then provided based on spectral decomposition technique. Meanwhile, by determining the monotonicity of an auxiliary function, a connection between convergence rate, step size and edge weights is established. Finally, simulation examples illustrate the theoretical results. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Distributed optimization
Augmented Lagrange method
Convergence analysis
Factorization of weighted Laplacian
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJ
OAAI
BMJIF0
OAAIShareSaveShareSaveShareSaveEffect of ω-3 fatty acids on rectal mucosal cell proliferation in subjects at risk for colon cancerOAAI
OAAIShareSave
ShareSaveAn Efficient EM Algorithm for Energy-Based Multisource Localization in Wireless Sensor Networks
PREAI
ShareSave
View more