Computational experience with conjugate gradient algorithms

DOI10.1007/BF02575929MaRDI QIDQ1146505zbMATH OpenOpenAlexFDO

Authors Marida Bertocchi, E. Spedicato

Publication date 1979

Published in Calcolo (Search for Journal in Brave)

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

zbMATH Keywords

computational studytest problemsconjugate gradient algorithmsnonlinear scalingFletcher-ReevesPolak-Ribiere

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3503002 (Why is no real title available?)
• scientific article; zbMATH DE number 3617919 (Why is no real title available?)
• scientific article; zbMATH DE number 3439902 (Why is no real title available?)
• A Note on the Determination of the Scaling Parameters in a Class of Quasi-Newton Methods for Unconstrained Minimization
• Comparison of some conjugate direction procedures for function minimization
• Conjugate Gradient Methods with Inexact Searches
• Function minimization by conjugate gradients
• Linear Convergence of the Conjugate Gradient Method
• Optimal conditioning of self-scaling variable Metric algorithms
• Restart procedures for the conjugate gradient method

Cited in

(1)

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

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

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