Speedups for CA-SFISTA and CA-SPNM

Avoiding Communication in Proximal Methods for Convex Optimization Problems

This technical report studies communication-avoiding proximal methods for large-scale convex optimization problems. The methods use iteration overlap and Hessian reuse to reduce latency costs while preserving the bandwidth profile of the baseline proximal algorithms.

October 2017 · Saeed Soori, Aditya Devarakonda, Zachary Blanco, James Demmel, Mert Gurbuzbalaban, Maryam Mehri Dehnavi