Pages that link to "Item:Q4558510"
From MaRDI portal
The following pages link to On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510):
Displaying 14 items.
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- Pathwise coordinate optimization for sparse learning: algorithm and theory (Q1747736) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity (Q5063626) (← 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)
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods (Q5300539) (← links)
- Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
- Block Policy Mirror Descent (Q6093281) (← links)
- Robust supervised learning with coordinate gradient descent (Q6172182) (← links)
- Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
- Convergence rate of random scan coordinate ascent variational inference under log-concavity (Q6658291) (← links)
