Event-Triggered Distributed Stochastic Mirror Descent for Convex Optimization

This article is concerned with the distributed convex constrained optimization over a time-varying multiagent network in the non-Euclidean sense, where the bandwidth limitation of the network is considered. To save the network resources so as to reduce the communication costs, we apply an event-trig...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transaction on neural networks and learning systems Jg. 34; H. 9; S. 6480 - 6491
Hauptverfasser:	Xiong, Menghui, Zhang, Baoyong, Ho, Daniel W. C., Yuan, Deming, Xu, Shengyuan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.09.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Bandwidth Bregman divergence Constraints Convergence Convex functions Convexity Distance measurement distributed convex optimization Divergence event-triggered communication strategy Machine learning algorithms Mirrors Multiagent systems Optimization stochastic mirror descent algorithm Stochasticity Upper bound Upper bounds
ISSN:	2162-237X, 2162-2388, 2162-2388
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!