Conjugate Gradient Methods less Dependent on Conjugacy

DOI10.1137/1028155zbMath0625.90077OpenAlexW1964941900MaRDI QIDQ3028737

John Lawrence 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 gradientlarge-scale minimizationvariable metrichigh-dimensional minimizationsuccessive affine reduction

Mathematics Subject Classification ID

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

Related Items (12)

Global convergence of the Fletcher-Reeves algorithm with inexact linesearch ⋮ On accelerating Newton's method based on a conic model ⋮ The method of successive affine reduction for nonlinear minimization ⋮ 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 ⋮ A three-parameter family of nonlinear conjugate gradient methods ⋮ A numerical method for incompressible viscous flow simulation ⋮ Efficient generalized conjugate gradient algorithms. II: Implementation ⋮ A fast two-grid method for matrix H-equations ⋮ Generalized Polak-Ribière algorithm ⋮ Preconditioned low-order Newton methods

Uses Software

• L-BFGS

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