Pages that link to "Item:Q5854354"
From MaRDI portal
The following pages link to Random permutations fix a worst case for cyclic coordinate descent (Q5854354):
Displaying 13 items.
- Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- On convergence rate of the randomized Gauss-Seidel method (Q2228499) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems (Q4997835) (← links)
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
- Analyzing random permutations for cyclic coordinate descent (Q5113666) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Global stability of first-order methods for coercive tame functions (Q6608042) (← links)
