Readily implementable conjugate gradient methods

DOI10.1007/BF01588252MaRDI QIDQ3858045zbMATH OpenFDO

Authors

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceglobal convergenceconjugate gradient methodinexact line searchunconstrained minimizationcontinuously differentiable objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Approximation by rational functions (41A20)

Cites work

• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• A scheme for determining stepsizes for unconstrained optimization methods
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
• Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
• Function minimization by conjugate gradients
• Minimization of functions having Lipschitz continuous first partial derivatives
• On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations
• Rate of Convergence of Several Conjugate Gradient Algorithms
• Restart procedures for the conjugate gradient method
• The conjugate gradient method in extremal problems

Cited in

(4)

• Orthogonality correction in the conjugate-gradient method
• New results on a class of exact augmented Lagrangians
• An algorithm for linearly constrained nonlinear programming problems
• A least-distance programming procedure for minimization problems under linear constraints

This page was built for publication: Readily implementable conjugate gradient methods

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