Worst-case complexity of cyclic coordinate descent: O(n²) gap with randomized version

Keyphrases

• Convergence Rate 33%
• Convex Quadratic Function 16%
• Cyclic Coordinate Descent 100%
• Immediate Consequences 16%
• Iteration Matrix 16%
• Kaczmarz Method 33%
• Large Gap 16%
• Non-axisymmetric 16%
• Numerical Experiments 16%
• Off-diagonal 16%
• Practical Performance 16%
• Projection onto Convex Sets 33%
• Randomized Coordinate Descent 50%
• Solving Systems of Linear Equations 16%
• Spectral Radius 16%
• Worst-case Complexity 100%

Mathematics

• Convergence Rate 66%
• Convex Set 66%
• Diagonal Entry 33%
• Linear System 33%
• Matrix (Mathematics) 33%
• Numerical Experiment 33%
• Quadratic Function 33%
• Spectral Radius 33%
• Worst Case 100%

Computer Science

• Case Complexity 100%
• Condition Number 16%
• Convergence Rate 33%
• Cyclic Coordinate Descent 100%
• Diagonal Entry 16%
• Iteration Matrix 16%
• Linear Systems 16%
• Spectral Radius 16%