Communication complexity of convex optimization (Q1100896)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Communication complexity of convex optimization |
scientific article; zbMATH DE number 4045147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication complexity of convex optimization |
scientific article; zbMATH DE number 4045147 |
Statements
Communication complexity of convex optimization (English)
0 references
1987
0 references
We consider a situation where each of two processors has access to a different convex function \(f_ i\), \(i=1,2\), defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which \(f_ 1+f_ 2\) is minimized, within some prespecified accuracy \(\epsilon\). Our objective is to determine protocols under which the number of exchanged messages is minimized.
0 references
communication complexity
0 references
convex optimization
0 references
protocols
0 references
