Pages that link to "Item:Q2178981"
From MaRDI portal
The following pages link to Subsampled nonmonotone spectral gradient methods (Q2178981):
Displaying 8 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration (Q2057056) (← links)
- Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
- Subsampled Hessian Newton Methods for Supervised Learning (Q5380307) (← links)
- A CLASS OF NONMONOTONE SPECTRAL MEMORY GRADIENT METHOD (Q5850815) (← links)
- Subsampled inexact Newton methods for minimizing large sums of convex functions (Q5857347) (← links)
- AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems (Q6644996) (← links)