Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
From MaRDI portal
Publication:4090137
DOI10.1007/BF01580652zbMath0325.90057MaRDI QIDQ4090137
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
49M20: Numerical methods of relaxation type
90C99: Mathematical programming
Related Items
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, Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Readily implementable conjugate gradient methods
Cites Work
- Unnamed Item
- 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
- 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
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
- Methods of conjugate directions versus quasi-Newton methods
- Linear Convergence of the Conjugate Gradient Method
- Practical convergence conditions for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
