On the communication complexity of Lipschitzian optimization for the coordinated model of computation

DOI10.1006/jcom.2000.0544zbMath0958.68060OpenAlexW2117680112MaRDI QIDQ1578430

Mehran Mesbahi, George P. Papavassilopoulos

Publication date: 27 August 2000

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

Full work available at URL: https://semanticscholar.org/paper/08004b67863e4827f8c9807911e60ea53689ffe2

zbMATH Keywords

information-based complexityLipschitzian optimization

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• Communication complexity of convex optimization
• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• On the Communication Complexity of Solving a Polynomial Equation
• Lower Bounds on Information Transfer in Distributed Computations
• Some Complexity Results for Matrix Computations on Parallel Processors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item