Readily implementable conjugate gradient methods
- 1 December 1979
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 298-319
- https://doi.org/10.1007/bf01588252
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A scheme for determining stepsizes for unconstrained optimization methodsIEEE Transactions on Automatic Control, 1978
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searchesMathematical Programming, 1976
- Conjugate Gradient Algorithms: Quadratic Termination without Linear SearchesIMA Journal of Applied Mathematics, 1975
- Alternative proofs of the convergence properties of the conjugate-gradient methodJournal of Optimization Theory and Applications, 1974
- On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizationsIEEE Transactions on Automatic Control, 1973
- 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
- The conjugate gradient method in extremal problemsUSSR Computational Mathematics and Mathematical Physics, 1969
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- Function minimization by conjugate gradientsThe Computer Journal, 1964