Computational experience with conjugate gradient algorithms

DOI10.1007/BF02575929zbMath0447.65035OpenAlexW2058150299MaRDI QIDQ1146505

Emilio Spedicato, Marida Bertocchi

Publication date: 1979

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575929

zbMATH Keywords

test problemscomputational studynonlinear scalingconjugate gradient algorithmsFletcher-ReevesPolak-Ribiere

Mathematics Subject Classification ID

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

Related Items (1)

A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of some conjugate direction procedures for function minimization
• Optimal conditioning of self-scaling variable Metric algorithms
• A Note on the Determination of the Scaling Parameters in a Class of Quasi-Newton Methods for Unconstrained Minimization
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• Function minimization by conjugate gradients
• Linear Convergence of the Conjugate Gradient Method

This page was built for publication: Computational experience with conjugate gradient algorithms