×
Powell, M. J. D.

Restart procedures for the conjugate gradient method. (English) Zbl 0396.90072

Math. Program. 12, 241-254 (1977).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0396.90072

Cited in 3 Reviews
Cited in 154 Documents

MSC:

90C30 Nonlinear programming

Keywords:

Nonlinear Programming; Restart Procedures; Convergence Analysis; Conjugate Gradient Method
PDF BibTeX XML Cite
\textit{M. J. D. Powell}, Math. Program. 12, 241--254 (1977; Zbl 0396.90072)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] E.M.L. Beale, ”A derivation of conjugate gradients”, in: F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, London, 1972) pp. 39–43.
[2] H.P. Crowder and P. Wolfe, ”Linear convergence of the conjugate gradient method”,IBM Journal of Research and Development 16 (1972) 431–433. · Zbl 0263.65068
[3] R. Fletcher, ”A Fortran subroutine for minimization by the method of conjugate gradients”, Report R-7073, A.E.R.E., Harwell, 1972.
[4] R. Fletcher and M.J.D. Powell, ”A rapidly convergent descent method for minimization”,Computer Journal 6 (1963) 163–168. · Zbl 0132.11603
[5] R. Fletcher and C.M. Reeves, ”Function minimization by conjugate gradients”,Computer Journal 7 (1964) 149–154. · Zbl 0132.11701
[6] D.G. Luenberger,Introduction to linear and nonlinear programming (Addison-Wesley, New York, 1973). · Zbl 0297.90044
[7] M.F. McGuire and P. Wolfe, ”Evaluating a restart procedure for conjugate gradients”, Report RC-4382, IBM Research Center, Yorktown Heights, 1973.
[8] E. Polak,Computational methods in optimization: a unified approach (Academic Press, London, 1971). · Zbl 0257.90055
[9] M.J.D. Powell, ”Some convergence properties of the conjugate gradient method”,Mathematical Programming 11 (1976) 42–49. · Zbl 0356.65056
[10] G. Zoutendijk, ”Nonlinear programming, computational methods”, in: J. Adabie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970) pp. 37–86. · Zbl 0336.90057
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.