John N. Tsitsiklis, Zhi Quan Luo

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


A situation in which each of two processors has access to a different convex function f//i ,i equals 1,2 defined on a common bounded domain is considered. The processes are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which f//1 plus f//2 is minimized, within some prespecified accuracy epsilon . Protocols under which the number of exchanged messages is minimized are determined.

Original languageEnglish (US)
Pages (from-to)608-611
Number of pages4
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1986

Bibliographical note

Funding Information:
* Research supported by the Army Research Office under Contract DAAAG-29-84-K-0005 and by the OtTice of Naval Research under Contract NOOO14-84-K-0519(N R 649-003). A preliminary version of this paper was presented at the 25th IEEE Conference on Decision and Control, Athens, Greece, Dec. 1986.


Dive into the research topics of 'COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.'. Together they form a unique fingerprint.

Cite this