Peter Richtárik

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an

Accelerated, Parallel, and Proximal Coordinate Descent

\varepsilon

Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting

-accurate solution with probability at least

Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design

1-\rho

Randomized Iterative Methods for Linear Systems

in at most