Pages that link to "Item:Q2829566"
From MaRDI portal
The following pages link to Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566):
Displaying 16 items.
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- (Q4558169) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- (Q4999081) (← links)
- A discrete dynamics approach to sparse calculation and applied in ontology science (Q5205890) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)
