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 ε-accurate solution with probability at least 1 − ρ in at most O((n/ε) log(1/ρ)) iterations, where n is the number of blocks. This extends recent results of Nesterov [Efficiency of coordinate descent methods on huge-scale optimization problems , SIAM J Optimization 22(2), pp. 341–362, 2012], which cover the smooth case, to composite minimization, while at the same time improving the complexity by the factor of 4 and removing ε from the logarithmic term. More importantly, in contrast with the aforementioned work in which the author achieves the results by applying the method to a regularized version of the objective function with an unknown scaling factor, we show that this is not necessary, thus achieving first true iteration complexity bounds. For strongly convex functions the method converges linearly. In the smooth case we also allow for arbitrary probability vectors and non-Euclidean norms. Finally, we demonstrate numerically that the algorithm is able to solve huge-scale ℓ 1-regularized least squares with a billion variables. An extended abstract of a preliminary version of this paper appeared in [15].

DOI: 10.1007/s10107-012-0614-z

Extracted Key Phrases

Showing 1-10 of 206 extracted citations
Citations per Year

340 Citations

Semantic Scholar estimates that this publication has received between 272 and 428 citations based on the available data.

See our FAQ for additional information.