Distributed constrained optimization over unbalanced graphs and delayed gradient

In this paper, we investigate a distributed constrained optimization problem subject to convex, closed, and nonidentical set constraints over unbalanced graphs, where each agent has local access to its strongly convex objective function and collaborates, minimizing the sum of these functions. To add...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Franklin Institute Ročník 362; číslo 2; s. 107466
Hlavní autoři: Huang, Qing, Fan, Yuan, Cheng, Songsong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.01.2025
Témata:
Convergence
Distributed optimization
Gradient delay
Nonidentical constraints
Unbalanced graphs
Distributed optimization
Nonidentical constraints
Gradient delay
Unbalanced graphs
Convergence
ISSN:0016-0032
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we investigate a distributed constrained optimization problem subject to convex, closed, and nonidentical set constraints over unbalanced graphs, where each agent has local access to its strongly convex objective function and collaborates, minimizing the sum of these functions. To address this problem, we design a distributed projected delayed gradient algorithm by using the available delayed gradient information, which removes dependence on the current gradient information and increases iteration efficiency. Moreover, to improve communication robustness, the algorithm is only based on a row stochastic weight matrix and achieves an O(1/T) convergence rate for a non-negative and diminishing step size. Finally, we present a numerical example to verify the effectiveness of the algorithm.
ISSN:0016-0032
DOI:10.1016/j.jfranklin.2024.107466