Convergence Theorems for Least-Change Secant Update Methods
Authors:
- Jr. J. E. DennisJDJr. J. E. Dennis
- Homer F. WalkerHWHomer F. Walker
- 1 December 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 18 (6) , 949-987
Abstract
The purpose of this paper is to present a convergence analysis of least change secant methods in which part of the derivative matrix being approximated is computed by other means. The theorems and proofs given here can be viewed as generalizations of those given by Broyden–Dennis–Moré [J. Inst. Math. Appl. 12 (1973), pp. 223–246] and by Dennis–Moré [Math. Comp., 28 (1974), pp. 549–560]. The analysis is done in the orthogonal projection setting of Dennis–Schnabel [SIAM Rev., 21(1980), pp. 443–459] and many readers might feel that it is easier to understand. The theorems here readily imply local and q-superlinear convergence of all the standard methods in addition to proving these results for the first time for the sparse symmetric method of Marwil and Toint and the nonlinear least-squares method of Dennis–Gay–Welsch.Keywords
This publication has 24 references indexed in Scilit:
- Least Change Secant Updates for Quasi-Newton MethodsSIAM Review, 1979
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residualsMathematical Programming, 1977
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- Solving the nonlinear least square problem: Application of a general methodJournal of Optimization Theory and Applications, 1976
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973
- SOME COMPUTATIONAL TECHNIQUES FOR THE NONLINEAR LEAST SQUARES PROBLEM1973
- The convergence of an algorithm for solving sparse nonlinear systemsMathematics of Computation, 1971
- A new approach to variable metric algorithmsThe Computer Journal, 1970
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965