A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization

In this paper we consider a general problem set-up for a wide class of convex and robust distributed optimization problems in peer-to-peer networks. In this set-up convex constraint sets are distributed to the network processors who have to compute the optimizer of a linear cost function subject to...

Celý popis

Podrobná bibliografie

Vydáno v:	arXiv.org
Hlavní autoři:	Bürger, Mathias, Notarstefano, Giuseppe, Allgöwer, Frank
Médium:	Paper
Jazyk:	angličtina
Vydáno:	Ithaca Cornell University Library, arXiv.org 25.03.2013
Témata:	Algorithms Approximation Cutting Distributed generation Economic models Mathematical analysis Microprocessors Optimization Peer to peer computing Position sensing Processors Remote sensors Robustness Social networks Wireless sensor networks
ISSN:	2331-8422
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!