Pages that link to "Item:Q2277157"
From MaRDI portal
The following pages link to Efficient generalized conjugate gradient algorithms. II: Implementation (Q2277157):
Displaying 13 items.
- Efficient generalized conjugate gradient algorithms. I: Theory (Q915657) (← links)
- A generalized conjugate gradient algorithm (Q1265069) (← links)
- Generalized Polak-Ribière algorithm (Q1321261) (← links)
- Preconditioned low-order Newton methods (Q1321417) (← links)
- A faster version of the ASG algorithm (Q1343522) (← links)
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization (Q1713190) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory (Q2569193) (← links)
- Comparison of optimization algorithms (Q3334509) (← links)
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization (Q4323721) (← links)
- A conjugate gradient method with quasi-Newton approximation (Q4522997) (← links)
- On CG algorithms as objects of scientific study: An appendix (Q4657825) (← links)
- The Limited Memory Conjugate Gradient Method (Q5408214) (← links)