Pages that link to "Item:Q2325237"
From MaRDI portal
The following pages link to Smooth minimization of nonsmooth functions with parallel coordinate descent methods (Q2325237):
Displaying 13 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
