Randomly Activated Proximal Methods for Nonsmooth Convex Minimization

We propose stochastic algorithms for solving large scale nonsmooth convex composite minimization problems. They activate at each iteration blocks of randomly selected proximity operators and achieve almost sure convergence of the iterates to a solution without any regularity assumptions. Numerical applications to data analysis problems are provided.