Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
From MaRDI portal
Publication:4090137
Cites work
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- Alternative proofs of the convergence properties of the conjugate- gradient method
- Comparison of some conjugate direction procedures for function minimization
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- Convergence Conditions for Ascent Methods
- Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
- Function minimization by conjugate gradients
- Linear Convergence of the Conjugate Gradient Method
- Methods of conjugate directions versus quasi-Newton methods
- Methods of conjugate gradients for solving linear systems
- On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations
- Practical convergence conditions for unconstrained optimization
- Rate of Convergence of Several Conjugate Gradient Algorithms
- The conjugate gradient method in extremal problems
Cited in
(6)- 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
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- 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)
