A three-term conjugate gradient algorithm for large-scale nonsmooth minimizations

MaRDI QIDQ4996718zbMATH OpenFDO

Authors Yong Li, C. Q. Liu

Publication date 1 July 2021

zbMATH Keywords

conjugate gradient methodglobal convergencelarge-scale optimizationnonsmooth optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• A conjugate gradient method for solving large-scale nonsmooth minimizations
• scientific article; zbMATH DE number 7028651
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems

Cited in

(6)

• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• A three-parameter family of nonlinear conjugate gradient methods
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
• A conjugate gradient method for solving large-scale nonsmooth minimizations
• A smoothing three-term conjugate gradient method for solving finite minimax problems
• A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem

This page was built for publication: A three-term conjugate gradient algorithm for large-scale nonsmooth minimizations

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