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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE/CAA journal of automatica sinica Ročník 1; číslo 1; s. 61 - 67
Hlavní autori:	Zhang, Yanqiong, Lou, Youcheng, Hong, Yiguang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Chinese Association of Automation (CAA) 01.01.2014
Predmet:	Algorithm design and analysis approximate gradient Approximation algorithms Constraints Convex functions distributed optimization Linear programming Multi-agent systems Optimization
ISSN:	2329-9266, 2329-9274
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!