Communication complexity of convex optim
β
John N Tsitsiklis; Zhi-Quan Luo
π
Article
π
1987
π
Elsevier Science
π
English
β 692 KB
We consider a situation where each of two processors has access to a different convex functionA, 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, + h is minimized, wi