Pages that link to "Item:Q3465244"
From MaRDI portal
The following pages link to Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244):
Displaying 30 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems (Q2168919) (← links)
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Randomized Block Adaptive Linear System Solvers (Q6094749) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Randomized methods for computing optimal transport without regularization and their convergence analysis (Q6571381) (← links)
- Acceleration and restart for the randomized Bregman-Kaczmarz method (Q6615435) (← links)