Push-sum Distributed Dual Averaging Online Convex Optimization With Bandit Feedback

This paper investigates the distributed online convex optimization problem in multi-agent systems, where each node cannot directly access the gradient information of its own cost function. The communication topology is formed by the strongly connected time-varying directed graphs with the column sto...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of control, automation, and systems automation, and systems, 2024-05, Vol.22 (5), p.1461-1471
Hauptverfasser:	Yang, Ju, Wei, Mengli, Wang, Yan, Zhao, Zhongyuan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Control Convex analysis Convexity Cost function Decision theory Engineering Graph theory Graphs Mechatronics Multiagent systems Optimization Parameter estimation Regular Papers Robotics Topology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!