Conditions for variable-metric algorithms to be conjugate-gradient algorithms

DOI10.1007/BF00935363MaRDI QIDQ1173014zbMATH OpenOpenAlexFDO

Authors D. G. McDowell

Publication date 1983

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationvariable-metric algorithmsconjugate- gradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A Rapidly Convergent Descent Method for Minimization
• Methods of conjugate gradients for solving linear systems
• Numerical experiments on quadratically convergent algorithms for function minimization
• Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
• Unified approach to quadratically convergent algorithms for function minimization
• Variable Metric Method for Minimization
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions

Cited in

(1)

• scientific article; zbMATH DE number 4180681 (Why is no real title available?)

This page was built for publication: Conditions for variable-metric algorithms to be conjugate-gradient algorithms

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