Communication complexity of convex optimization (Q1100896): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds on Information Transfer in Distributed Computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3967358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Communication Complexity of Computing the Hamming Distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of designing distributed protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883494 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3326832 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0885-064x(87)90013-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W139031692 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:59, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Communication complexity of convex optimization |
scientific article |
Statements
Communication complexity of convex optimization (English)
0 references
1987
0 references
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.
0 references
communication complexity
0 references
convex optimization
0 references
protocols
0 references