A conjugate gradient method based on subset of subspace

MaRDI QIDQ5472397zbMATH OpenFDO

Authors Guangming Zhou, Shuren Liu

Publication date 12 June 2006

zbMATH Keywords

convergenceline searchnonlinear cunjugate gradient methodnumerical experiment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
• A Subspace Study on Conjugate Gradient Algorithms
• Global convergence of a new nonlinear conjugate gradient method
• scientific article; zbMATH DE number 641552
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization

Cited in

(2)

• Modified Active Subspaces Using the Average of Gradients
• A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory

This page was built for publication: A conjugate gradient method based on subset of subspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472397)