Pages that link to "Item:Q494345"
From MaRDI portal
The following pages link to On the complexity analysis of randomized block-coordinate descent methods (Q494345):
Displaying 13 items.
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping (Q5501199) (← links)
- Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization (Q5501228) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Block coordinate type methods for optimization and learning (Q5889894) (← links)
- Adaptive coordinate sampling for stochastic primal–dual optimization (Q6092496) (← links)
- Block Policy Mirror Descent (Q6093281) (← links)
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces (Q6101039) (← links)
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems (Q6142558) (← links)
- Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training (Q6171686) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Adaptive proximal SGD based on new estimating sequences for sparser ERM (Q6196471) (← links)
