Pages that link to "Item:Q2569194"
From MaRDI portal
The following pages link to Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application (Q2569194):
Displaying 16 items.
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- Convergence of Liu-Storey conjugate gradient method (Q881512) (← links)
- Conjugate direction methods and polarity for quadratic hypersurfaces (Q1695819) (← links)
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) (← links)
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation (Q2023682) (← links)
- Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128) (← links)
- Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances (Q2226298) (← links)
- A framework of conjugate direction methods for symmetric linear systems in optimization (Q2342136) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory (Q2569193) (← links)
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
- A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization (Q5116544) (← links)
- A dwindling filter line search method for unconstrained optimization (Q5497020) (← links)
