Mini-batch stochastic conjugate gradient algorithms with minimal variance
From MaRDI portal
Cites work
- A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize
- A mini-batch stochastic conjugate gradient algorithm with variance reduction
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Stochastic Approximation Method
- Adaptive subgradient methods for online learning and stochastic optimization
- Efficient hybrid conjugate gradient techniques
- First-order and stochastic optimization methods for machine learning
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Large-scale machine learning with stochastic gradient descent
- Methods of conjugate gradients for solving linear systems
- Nonlinear conjugate gradient methods for unconstrained optimization
- Stochastic dual coordinate ascent methods for regularized loss minimization
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- The conjugate gradient method in extremal problems
- The Limited Memory Conjugate Gradient Method
This page was built for publication: Mini-batch stochastic conjugate gradient algorithms with minimal variance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232365)
