On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent

Dual first-order methods are essential techniques for large-scale constrained convex optimization. However, when recovering the primal solutions, we need T(ε-2) iterations to achieve an ε-optimal primal solution when we apply an algorithm to the non-strongly convex dual problem with T(ε-1) iterations to achieve an ε-optimal dual solution, where T(x) can be x or √x. In this paper, we prove that the iteration complexity of the primal solutions and dual solutions have the same Oleft(frac1√εright) order of magnitude for the accelerated randomized dual coordinate ascent. When the dual function further satisfies the quadratic functional growth condition, by restarting the algorithm at any period, we establish the linear iteration complexity for both the primal solutions and dual solutions even if the condition number is unknown. When applied to the regularized empirical risk minimization problem, we prove the iteration complexity of Oleft(nlog n+√fracnεright) in both primal space and dual space, where n is the number of samples. Our result takes out the left(log frac1εright) factor compared with the methods based on smoothing/regularization or Catalyst reduction. As far as we know, this is the first time that the optimal Oleft(√fracnεright) iteration complexity in the primal space is established for the dual coordinate ascent based stochastic algorithms. We also establish the accelerated linear complexity for some problems with nonsmooth loss, i.e., the least absolute deviation and SVM.