Pages that link to "Item:Q5962715"
From MaRDI portal
The following pages link to Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715):
Displaying 26 items.
- An Optimal High-Order Tensor Method for Convex Optimization (Q5026443) (← links)
- Active Subspace of Neural Networks: Structural Analysis and Universal Attacks (Q5037556) (← links)
- (Q5054606) (← links)
- On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
- On the Adaptivity of Stochastic Gradient-Based Optimization (Q5114394) (← links)
- (Q5148934) (← links)
- (Q5148937) (← links)
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
- (Q5159404) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- (Q5214210) (← links)
- An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
- A stochastic algorithm with optimal convergence rate for strongly convex optimization problems (Q5257146) (← links)
- Importance sampling in signal processing applications (Q5358731) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning (Q5506688) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates (Q5882231) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
- An aggressive reduction on the complexity of optimization for non-strongly convex objectives (Q6052286) (← links)
- Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
- A safe double screening strategy for elastic net support vector machine (Q6178350) (← links)
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
- An accelerated stochastic mirror descent method (Q6601963) (← links)
- Support vector machine in big data: smoothing strategy and adaptive distributed inference (Q6643223) (← links)
