Communication issues in parallel and distributed optimization algorithms

Summary form only given, as follows. Massive speedups through parallel optimization methods will not likely be achieved without efficient communication between processors. Three related issues are discussed: optimization algorithms that can take advantage of special communication-efficient hardware such as processor arrays; optimal routing algorithms for linear algebra calculations in message-passing architectures; and convergence theory of asynchronous algorithms.<
>