On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

Mesbahi, M; Papavassilopoulos, G

dc.contributor.author	Mesbahi, M	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:49:31Z
dc.date.available	2014-03-01T01:49:31Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25819
dc.subject	Communication Complexity	en
dc.subject	Coordination Model	en
dc.subject	lipschitz continuity	en
dc.title	On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation	en
heal.type	journalArticle	en
heal.identifier.primary	10.1006/jcom.2000.0544	en
heal.identifier.secondary	http://dx.doi.org/10.1006/jcom.2000.0544	en
heal.publicationDate	2000	en
heal.abstract	.We consider the problem of approximating the maximum of the sumof m Lipschitz continuous functions. The values of each function areassumed to reside at a different memory element. A single processingelement is designated to approximate the value of the maximum ofthe sum of these functions by adopting a certain protocol. Under certainassumptions on the class of permissible protocols, we obtain	en
heal.journalName	Journal of Complexity	en
dc.identifier.doi	10.1006/jcom.2000.0544	en