DocumentCode
3537966
Title
Gossip-based random projection algorithm for distributed optimization: Error bound
Author
Soomin Lee ; Nedic, Angelia
Author_Institution
Electr. & Comput. Eng., Univ. of Illinois, Urbana, IL, USA
fYear
2013
fDate
10-13 Dec. 2013
Firstpage
6874
Lastpage
6879
Abstract
We consider a fully distributed constrained convex optimization problem over a multi-agent network. We discuss an asynchronous gossip-based random projection (GRP) algorithm that solves the distributed problem using only local communication and computation. We analyze its error bound for a constant stepsize and provide simulation results on a distributed robust model predictive control problem.
Keywords
distributed control; multi-agent systems; optimisation; predictive control; robust control; GRP algorithm; asynchronous gossip-based random projection algorithm; distributed robust model predictive control problem; error bound; fully distributed constrained convex optimization problem; gossip-based random projection algorithm; multiagent network; Optimal control; Predictive control;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on
Conference_Location
Firenze
ISSN
0743-1546
Print_ISBN
978-1-4673-5714-2
Type
conf
DOI
10.1109/CDC.2013.6760978
Filename
6760978
Link To Document