An adaptive stochastic gradient algorithm based on FISTA for convex optimization
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A proximal stochastic gradient method with progressive variance reduction
- A Stochastic Approximation Method
- A study on L2-loss (squared hinge-loss) multiclass SVM
- Accelerated stochastic variance reduction for a class of convex optimization problems
- Adaptive restart for accelerated gradient schemes
- Balancing rates and variance via adaptive batch-size for stochastic optimization problems
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- scientific article; zbMATH DE number 7753352 (Why is no real title available?)
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- Parameter-free FISTA by adaptive restart and backtracking
- Random-reshuffled SARAH does not need full gradient computations
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Stochastic Gradient Descent with Preconditioned Polyak Step-size
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- SVRG meets AdaGrad: painless variance reduction
- Understanding machine learning. From theory to algorithms
This page was built for publication: An adaptive stochastic gradient algorithm based on FISTA for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891026)
