339 citations · 954 across the 23 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2016★ 17 cited
Worst-case Complexity of Cyclic Coordinate Descent: Gap with Randomized Version
Ruoyu Sun, Yinyu Ye
This paper concerns the worst-case complexity of cyclic coordinate descent (C-CD) for minimizing a convex quadratic function, which is equivalent to Gauss-Seidel method and can be…
math.OC2015★ 15 cited
Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems
Ruoyu Sun, Mingyi Hong
The iteration complexity of the block-coordinate descent (BCD) type algorithm has been under extensive investigation. It was recently shown that for convex problems the classical c…
math.OC2015★ 13 cited
On the Efficiency of Random Permutation for ADMM and Coordinate Descent
Ruoyu Sun, Zhi-Quan Luo, Yinyu Ye
Random permutation is observed to be powerful for optimization algorithms: for multi-block ADMM (alternating direction method of multipliers), while the classical cyclic version di…