Communication complexity of convex optimization (Q1100896): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 16:41, 18 June 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