Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
From MaRDI portal
Publication:2086938
DOI10.3934/jimo.2021084OpenAlexW3153006658MaRDI QIDQ2086938
Jie Sun, Tengteng Yu, Yu-Hong Dai, Xin-Wei Liu
Publication date: 26 October 2022
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2021084
Barzilai-Borwein methodvariable metricnonconvex nonsmooth optimizationproximal Polyak-Łojasiewicz inequalityproximal stochastic gradient method
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing finite sums with the stochastic average gradient
- Introductory lectures on convex optimization. A basic course.
- Inexact proximal stochastic gradient method for convex composite optimization
- A family of variable metric proximal methods
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- A linearly convergent stochastic recursive gradient method for convex optimization
- A family of spectral gradient methods for optimization
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Two-Point Step Size Gradient Methods
- Optimization Methods for Large-Scale Machine Learning
- Gradient methods exploiting spectral properties
- Inexact proximal stochastic second-order methods for nonconvex composite optimization
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- A Proximal Stochastic Gradient Method with Progressive Variance Reduction
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- A Stochastic Approximation Method
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
