Communication complexity of convex optimization

DOI10.1016/0885-064X(87)90013-6zbMath0641.68063OpenAlexW139031692MaRDI QIDQ1100896

John N. Tsitsiklis, Zhi-Quan Luo

Publication date: 1987

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(87)90013-6

zbMATH Keywords

convex optimizationcommunication complexityprotocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical optimization and variational techniques (65K10)

Related Items (3)

Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity ⋮ On the communication complexity of Lipschitzian optimization for the coordinated model of computation ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights

Cites Work

• On the complexity of designing distributed protocols
• Communication Complexity of Computing the Hamming Distance
• Lower Bounds on Information Transfer in Distributed Computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communication complexity of convex optimization