Pages that link to "Item:Q2220668"
From MaRDI portal
The following pages link to Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668):
Displaying 12 items.
- The cycle time vector of D-A-D functions (Q1963931) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- Randomized Gradient Boosting Machine (Q4971024) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Random permutations fix a worst case for cyclic coordinate descent (Q5854354) (← links)
- Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
- Randomized methods for computing optimal transport without regularization and their convergence analysis (Q6571381) (← links)
- On greedy multi-step inertial randomized Kaczmarz method for solving linear systems (Q6622730) (← links)
- PolyCD: optimization via cycling through the vertices of a polytope (Q6633143) (← links)
