Pages that link to "Item:Q2228399"
From MaRDI portal
The following pages link to A linearly convergent stochastic recursive gradient method for convex optimization (Q2228399):
Displaying 10 items.
- A stochastic conjugate gradient method for the approximation of functions (Q765306) (← links)
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization (Q2086938) (← links)
- Accelerating mini-batch SARAH by step size rules (Q2127094) (← links)
- An online conjugate gradient algorithm for large-scale data analysis in machine learning (Q2131556) (← links)
- Stochastic intermediate gradient method for convex optimization problems (Q2631196) (← links)
- (Q3533483) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
- Inexact SARAH algorithm for stochastic optimization (Q5859016) (← links)
- A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize (Q6097380) (← links)
- Variance reduced moving balls approximation method for smooth constrained minimization problems (Q6542460) (← links)