scientific article; zbMATH DE number 1371602

MaRDI QIDQ3835936zbMATH OpenFDO

Authors Yuhong Dai, Yaxiang Yuan

Publication date 15 November 2000

zbMATH Keywords

Beale-Powell restart algorithmconjugate gradient methodglobal convergenceunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• New three-term conjugate gradient method with guaranteed global convergence
• Global convergence of two kinds of three-term conjugate gradient methods without line search
• Some descent three-term conjugate gradient methods and their global convergence

Cited in

(10)

• Convergence properties of the Beale-Powell restart algorithm
• Memory gradient method with Goldstein line search
• Convergence results for 3D sparse grid approaches
• Global convergence of a new restarting three terms conjugate gradient method for non-linear optimizations
• scientific article; zbMATH DE number 1122853 (Why is no real title available?)
• The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
• Global convergence of the general three-term conjugate gradient methods with the relaxed strong Wolfe line-search
• Adaptive trust-region method on Riemannian manifold
• A descent hybridization of the Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods with applications to nonnegative matrix factorization and compressive sensing
• Some three-term conjugate gradient methods with the inexact line search condition

This page was built for publication:

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