Title :
Communication complexity of convex optimization
Author :
Tsitsiklis, J.N. ; Zhi-Quan Luo
Author_Institution :
Massachusetts Institute of Technology, Cambridge, MA, USA
Abstract :
We consider a situation where each one of two processors has access to a different convex function fi, 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 f1+f2 is minimized, within some prespecified accuracy ??. Our objective is to determine protocols under which the number of exchanged messages is minimized.
Keywords :
Access protocols; Complexity theory; Laboratories; Operations research; Very large scale integration;
Conference_Titel :
Decision and Control, 1986 25th IEEE Conference on
Conference_Location :
Athens, Greece
DOI :
10.1109/CDC.1986.267379
