Pages that link to "Item:Q2821800"
From MaRDI portal
The following pages link to Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions (Q2821800):
Displaying 6 items.
- Linear convergence of the randomized sparse Kaczmarz method (Q1717238) (← links)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems (Q2168919) (← links)
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
- Adaptively sketched Bregman projection methods for linear systems (Q5076003) (← links)
- Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
- On the convergence rate of Fletcher‐Reeves nonlinear conjugate gradient methods satisfying strong Wolfe conditions: Application to parameter identification in problems governed by general dynamics (Q6139736) (← links)
