Communication complexity of convex optimization (Q1100896)

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.