Pages that link to "Item:Q409265"
From MaRDI portal
The following pages link to Gradient algorithms for quadratic optimization with fast convergence rates (Q409265):
Displaying 11 items.
- An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost (Q360475) (← links)
- Estimation of spectral bounds in gradient algorithms (Q385581) (← links)
- Level set of the asymptotic rate of convergence for the method of steepest descent (Q2084237) (← links)
- A second-order gradient method for convex minimization (Q2236579) (← links)
- Steepest descent method with random step lengths (Q2397745) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces (Q2492701) (← links)
- (Q3314875) (← links)
- Near optimal step size and momentum in gradient descent for quadratic functions (Q4633246) (← links)
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
- A gradient method exploiting the two dimensional quadratic termination property (Q6110631) (← links)
