COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.

John N. Tsitsiklis; Zhi Quan Luo

doi:10.1109/cdc.1986.267379

COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.

John N. Tsitsiklis, Zhi Quan Luo

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	608-611
Number of pages	4
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1986.267379
State	Published - 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.

Access

10.1109/cdc.1986.267379

OpenUrl availability

Full text

Cite this

@article{ff650a67261345c4a23d9d11e7fb35b9,

title = "COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.",

abstract = "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.",

author = "Tsitsiklis, {John N.} and Luo, {Zhi Quan}",

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.",

year = "1986",

doi = "10.1109/cdc.1986.267379",

language = "English (US)",

pages = "608--611",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.

AU - Tsitsiklis, John N.

AU - Luo, Zhi Quan

N1 - 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.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022983239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022983239&partnerID=8YFLogxK

U2 - 10.1109/cdc.1986.267379

DO - 10.1109/cdc.1986.267379

M3 - Conference article

AN - SCOPUS:0022983239

SN - 0191-2216

SP - 608

EP - 611

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

COMMUNICATION COMPLEXITY OF CONVEX OPTIMIZATION.

Abstract

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this