Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems

We propose a distributed solution for a constrained convex optimization problem over a network of clustered agents each consisted of a set of subagents. The communication range of the clustered agents is such that they can form a connected undirected graph topology. The total cost in this optimizati...

Celý popis

Podrobná bibliografie

Vydáno v:	Automatica (Oxford) Ročník 129; s. 109608
Hlavní autoři:	Moradian, Hossein, Kia, Solmaz S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.07.2021
Témata:	Augmented Lagrangian Distributed constrained convex optimization Optimal resource allocation Penalty function methods Primal–dual solutions Distributed constrained convex optimization Optimal resource allocation Penalty function methods Augmented Lagrangian Primal–dual solutions
ISSN:	0005-1098, 1873-2836
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!