Incremental Proximal Methods for Large Scale Convex Optimization II: With a Randomized Order and a Diminishing Stepsize, Incremental Subgradient-Proximal Methods Converge Almost Surely to an OptimumResearch Paper
Many problems in statistical learning, signal processing and distributed optimization minimize a sum of a large number of convex components over a convex set: a data-fit term per sample plus a regularizer or constraint per sample. When is large, a method that processes one component per iteration is often far cheaper per step than one that evaluates the…