Efficiency of accelerated coordinate descent method on structured optimization problems
(2016) , 20 pages
Files
coredp2016_03copy.pdf
Open Access - Adobe PDF
- 3.45 MB
Details
- Authors
- Abstract
- In this paper we prove a new complexity bound for a variant of Accelerated Coordinate Descent Method [7]. We show that this method often outperforms the standard Fast Gradient Methods (FGM, [3, 6]) on optimization problems with dense data. In many important situations, the computational expenses of oracle and method itself at each iteration of our scheme are perfectly balanced (both depend linearly on dimensions of the problem). As application examples, we consider unconstrained convex quadratic minimization, and the problems arising in Smoothing Technique [6]. On some special problem instances, the provable acceleration factor with respect to FGM can reach the square root of the number of variables. Our theoretical conclusions are confirmed by numerical experiments.
- Affiliations
Citations
Nesterov, Y., & Stich, S. (2016). Efficiency of accelerated coordinate descent method on structured optimization problems (CORE Discussion Papers 2016/03). https://hdl.handle.net/2078.5/184949