Convergence conditions for restarted conjugate gradient methods with inaccurate line searches

DOI10.1007/BF01580652zbMATH Open0325.90057OpenAlexW2054287207MaRDI QIDQ4090137FDOQ4090137

Authors: M. L. Lenard 

Publication date: 1976

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods of relaxation type (49M20) Mathematical programming (90C99)

Cites Work

• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Rate of Convergence of Several Conjugate Gradient Algorithms
• Linear Convergence of the Conjugate Gradient Method
• Title not available (Why is that?)
• Comparison of some conjugate direction procedures for function minimization
• 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
• Methods of conjugate directions versus quasi-Newton methods
• Practical convergence conditions for unconstrained optimization
• On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations

Cited In (6)

• Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
• Readily implementable conjugate gradient methods
• Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
• A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method

This page was built for publication: Convergence conditions for restarted conjugate gradient methods with inaccurate line searches

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