Conjugate Gradient Methods less Dependent on Conjugacy

DOI10.1137/1028155MaRDI QIDQ3028737zbMATH OpenOpenAlexFDO

Authors J. L. Nazareth

Publication date 1986

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1028155

zbMATH Keywords

conjugate gradienthigh-dimensional minimizationlarge-scale minimizationsuccessive affine reductionvariable metric

Mathematics Subject Classification ID

Numerical methods based on necessary conditions (49M05) Linear programming (90C05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 992790
• Présentation de synthèse des méthodes de gradient conjugué
• On the convergence of conjugate gradient algorithms
• scientific article; zbMATH DE number 1022806
• New conjugate gradient-like methods for unconstrained optimization

Cited in

(13)

• On accelerating Newton's method based on a conic model
• A numerical method for incompressible viscous flow simulation
• Generalized Polak-Ribière algorithm
• Preconditioned low-order Newton methods
• A new taxonomy of conjugate gradient methods
• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
• Efficient generalized conjugate gradient algorithms. II: Implementation
• A three-parameter family of nonlinear conjugate gradient methods
• The method of successive affine reduction for nonlinear minimization
• A fast two-grid method for matrix H-equations
• A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
• Some numerical experiments with variable-storage quasi-Newton algorithms
• Conjugate gradient methods using quasi-Newton updates with inexact line searches

Describes a project that uses

Uses Software

• L-BFGS

This page was built for publication: Conjugate Gradient Methods less Dependent on Conjugacy

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