Readily implementable conjugate gradient methods

DOI10.1007/BF01588252zbMath0423.90068MaRDI QIDQ3858045

No author found.

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceglobal convergenceconjugate gradient methodunconstrained minimizationinexact line searchcontinuously differentiable objective function

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Orthogonality correction in the conjugate-gradient method

Cites Work

• Unnamed Item
• Minimization of functions having Lipschitz continuous first partial derivatives
• 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
• Restart procedures for the conjugate gradient method
• A scheme for determining stepsizes for unconstrained optimization methods
• Rate of Convergence of Several Conjugate Gradient Algorithms
• On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm

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