An approximate gradient algorithm for constrained distributed convex optimization

In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute the minimum of the sum of the local objective functions which are subject to a global inequality constraint and a global constraint set. Inst...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE/CAA journal of automatica sinica Jg. 1; H. 1; S. 61 - 67
Hauptverfasser:	Zhang, Yanqiong, Lou, Youcheng, Hong, Yiguang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Chinese Association of Automation (CAA) 01.01.2014
Schlagworte:	Algorithm design and analysis approximate gradient Approximation algorithms Constraints Convex functions distributed optimization Linear programming Multi-agent systems Optimization
ISSN:	2329-9266, 2329-9274
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!