Pages that link to "Item:Q5857347"
From MaRDI portal
The following pages link to Subsampled inexact Newton methods for minimizing large sums of convex functions (Q5857347):
Displaying 17 items.
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- Sub-sampled Newton methods (Q1739039) (← links)
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- Linesearch Newton-CG methods for convex optimization with noise (Q2084588) (← links)
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
- Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
- Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
- Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
- Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions (Q2693789) (← links)
- Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
- (Q5038021) (← links)
- An investigation of Newton-Sketch and subsampled Newton methods (Q5135249) (← links)
- Subsampled Hessian Newton Methods for Supervised Learning (Q5380307) (← links)
- LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums (Q5879118) (← links)
- Hessian averaging in stochastic Newton methods achieves superlinear convergence (Q6165593) (← links)
- Subsampled first-order optimization methods with applications in imaging (Q6606441) (← links)
- AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems (Q6644996) (← links)
