Pages that link to "Item:Q2397745"
From MaRDI portal
The following pages link to Steepest descent method with random step lengths (Q2397745):
Displaying 11 items.
- On the worst case performance of the steepest descent algorithm for quadratic functions (Q344945) (← links)
- Expected number of steps of a random optimization method. Reply (Q801821) (← links)
- On initial point selection of the steepest descent algorithm for general quadratic functions (Q2141353) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- Variable step size destabilizes the Störmer/leapfrog/Verlet method (Q2366660) (← links)
- Some convergence properties of the steepest descent algorithm revealed by renormalisation. (Q2768064) (← links)
- Population based steepest descent method (Q2792979) (← links)
- On the minimization of quadratic functions (Q3973211) (← links)
- (Q4203720) (← links)
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
- Renormalised steepest descent in Hilbert space converges to a two-point attractor. (Q5947373) (← links)