Abstract
The effect of numerical estimates of the gradient on Wolfe’s convergency proof for descent algorithms is considered. It is shown that there is a value εo such that if the termination criteria is set greater than this value then convergence is assured, but that below this value the behaviour is uncertain. This theoretical result is in agreement with previously published experimental results. A modified scheme for the search along a line is described which both enables a better estimate of the initial slope to be made, and then implies that convergence to a more accurate point can be achieved. It is known that variable metric methods are very unreliable when the function evaluation is subject to noise. It is shown that this is due to two reasons. The numerical estimates of the gradient become very unreliable and the standard line search strategy fails. The new linear search overcomes the second of these difficulties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Archetti and B. Betro (1975) Convex Programming via Stochastic Regularization Presented at 2nd Workshop on Global Optimisation, Varenna (1975)
M.C. Biggs (1973) J.I.M.A. Vol 12 No. 3 pp 337–9
M.C. Biggs (1975) The Numerical Optimisation Centre, The Hatfield Polytechnic, Technical Report No. 69.
A.H.O. Brown (1975) The Development of Computer Optimisation Procedures for use in Aero Engine Design. To appear in L.C.W. Dixon Ed., “Optimisation in Action”, Academic Press.
D.B. Crombie (1972) Review of the Performance of Hill Climbing Strategies when Applied in the Hybrid Computing Environment. M.Sc. Thesis, The Hatfield Polytechnic.
L.C.W. Dixon (1973) Nonlinear Optimisation: A survey. In D.J. Evans Ed., “Software for Numerical Mathematics”, Academic Press.
L.C.W. Dixon, J. Gomulka and S.E. Hersom (1975) Reflections on the Global Optimisation Problem. To appear in L.C.W. Dixon Ed., “Optimisation in Action”, Academic Press.
D. Goldfarb (1969) Sufficient conditions for convergence of a variable metric algorithm. In R. Fletcher Ed., “Optimisation”, Academic Press.
A.I. Mikhal-skii (1974) The method of averaged splines in the problem of approximating dependences on the basis of empirial data. Avtomatika i Telemekhanika 3 pp 45–50.
B.A. Murtagh and R.W.H. Sargent (1969) A constrained minimisation method with quadratic convergence. In R. Fletcher Ed., “Optimisation”, Academic Press.
M.J.D. Powell (1971) J. Inst. Maths. Applics 7 pp 21–36.
M.J.D. Powell (1974) C.S.S. 9, A.E.R.E. Harwell. Presented at “Mathematical Software II”, Purdue University.
M.J.D. Powell (1975) C.S.S. 15, A.E.R.E. Harwell. Presented at “AMS/SIAM Symposium on Nonlinear Programming”.
P. Wolfe (1969) Siam Review 11 pp 226–235.
P. Wolfe (1971) Siam Review 13 pp 185–188.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Dixon, L.C.W. (1976). On the Convergence of the Variable Metric Method with Numerical Derivatives and the Effect of Noise in the Function Evaluation. In: Oettli, W., Ritter, K. (eds) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46329-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-46329-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07616-2
Online ISBN: 978-3-642-46329-7
eBook Packages: Springer Book Archive