Spectral stochastic gradient method with additional sampling for finite and infinite sums
From MaRDI portal
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A non-monotone trust-region method with noisy oracles and additional sampling
- A Nonmonotone Line Search Technique for Newton’s Method
- Adaptive sampling strategies for stochastic optimization
- Distributed stochastic subgradient projection algorithms for convex optimization
- Gradient methods with adaptive step-sizes
- Lectures on Stochastic Programming
- LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums
- New adaptive stepsize selections in gradient methods
- Nonmonotone line search methods with variable sample size
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the inexact scaled gradient projection method
- On the nonmonotone line search
- On the steplength selection in gradient methods for unconstrained optimization
- Optimization methods for large-scale machine learning
- Spectral projected subgradient method for nonsmooth convex optimization problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(3)
This page was built for publication: Spectral stochastic gradient method with additional sampling for finite and infinite sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969553)
