Readily implementable conjugate gradient methods

DOI10.1007/BF01588252zbMATH Open0423.90068MaRDI QIDQ3858045FDOQ3858045

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

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

Cited In (4)

• New results on a class of exact augmented Lagrangians
• An algorithm for linearly constrained nonlinear programming problems
• Orthogonality correction in the conjugate-gradient method
• 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)