Global convergence of a two-parameter family of conjugate gradient methods without line search

DOI10.1016/S0377-0427(02)00416-8zbMATH Open1018.65081MaRDI QIDQ697544FDOQ697544

Jie Sun, Xiongda Chen

Publication date: 17 September 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• Global convergence of conjugate gradient methods without line search
• scientific article; zbMATH DE number 7071347
• GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
• Global convergence of two kinds of three-term conjugate gradient methods without line search
• scientific article; zbMATH DE number 6402147
• scientific article; zbMATH DE number 1349196
• scientific article; zbMATH DE number 5584863
• scientific article; zbMATH DE number 871316
• A family of nonlinear conjugate gradient methods with a global convergence property
• scientific article

zbMATH Keywords

global convergenceunconstrained optimizationnumerical experimentsconjugate gradient methodline searchlarge-scale problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• Function minimization by conjugate gradients
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Efficient generalized conjugate gradient algorithms. I: Theory
• Title not available (Why is that?)
• A three-parameter family of nonlinear conjugate gradient methods
• Global convergence of conjugate gradient methods without line search

Cited In (30)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Global convergence of conjugate gradient methods without line search
• GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
• A new hybrid method for nonlinear complementarity problems
• The convergence of conjugate gradient method with nonmonotone line search
• A modified PRP conjugate gradient method
• Global convergence of a memory gradient method without line search
• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
• A nonmonotone trust region method for unconstrained optimization
• An ODE-based trust region method for unconstrained optimization problems
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• Convergence of descent method without line search
• A note about WYL's conjugate gradient method and its applications
• Title not available (Why is that?)
• A new family of conjugate gradient methods
• The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
• A descent algorithm without line search for unconstrained optimization
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• Convergence of conjugate gradient methods with a closed-form stepsize formula
• New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
• CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD
• Adaptive trust-region algorithms for unconstrained optimization
• Convergence of Liu-Storey conjugate gradient method
• GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH
• GLOBAL CONVERGENCE OF A SPECTRAL CD CONJUGATE GRADIENT METHOD WITHOUT LINE SEARCH
• Some remarks on conjugate gradient methods without line search
• GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
• A nonmonotone conic trust region method based on line search for solving unconstrained optimization

Uses Software

• minpack

This page was built for publication: Global convergence of a two-parameter family of conjugate gradient methods without line search

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