A variable metric proximal stochastic gradient method: an application to classification problems
From MaRDI portal
Cites work
- A line search based proximal stochastic gradient algorithm with dynamical variance reduction
- A proximal stochastic gradient method with progressive variance reduction
- A variable metric forward-backward method with extrapolation
- Adaptive sampling strategies for stochastic optimization
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 7255141 (Why is no real title available?)
- Minimizing finite sums with the stochastic average gradient
- Nonmonotone line search methods with variable sample size
- Optimization methods for large-scale machine learning
- Proximal splitting methods in signal processing
- Sample size selection in optimization methods for machine learning
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Variable metric quasi-Fejér monotonicity
This page was built for publication: A variable metric proximal stochastic gradient method: an application to classification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020678)
