Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 10 (1) , 32-51
- https://doi.org/10.1007/bf01580652
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Practical convergence conditions for unconstrained optimizationMathematical Programming, 1973
- On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizationsIEEE Transactions on Automatic Control, 1973
- Methods of conjugate directions versus quasi-Newton methodsMathematical Programming, 1972
- Efficient Implementations of the Polak–Ribière Conjugate Gradient AlgorithmSIAM Journal on Control, 1972
- Rate of Convergence of Several Conjugate Gradient AlgorithmsSIAM Journal on Numerical Analysis, 1972
- Comparison of some conjugate direction procedures for function minimizationJournal of the Franklin Institute, 1969
- Convergence Conditions for Ascent MethodsSIAM Review, 1969
- The conjugate gradient method in extremal problemsUSSR Computational Mathematics and Mathematical Physics, 1969
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952