Summary
We consider the problem of solving systems of nonlinear algebraic equations by Quasi-Newton methods which are variationally obtainable. Properties of termination and of optimal conditioning of this class are studied. Extensive numerical experiments compare particular algorithms and show the superiority of two recently proposed methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Broyden, C.G.: A class of methods for solving nonlinear simultaneous equations. Math. Comput.19, 577–593 (1965)
Broyden, C.G., Johnson, M.P.: A class of rank-one optimization algorithms. In: Numerical methods for nonlinear optimization (F.A. Lootsma, ed.). New York: Academic Press 1973
Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optimization Theory Appl.5, 405–423 (1970)
Thomas, S.W.: Sequential estimation techniques for Quasi-Newton algorithms. Report TR 75-227, Cornell University, 1975
Pearson, J.: On variable metric methods of minimization. Comput. J.12, 171–178 (1971)
Broyden, C.G., Dennis, J., Moré, J.J.: On the local and superlinear convergence of Quasi-Newton methods. J. Inst. Math. Appl.12, 223–245 (1973)
Schweppe, F.C.: Recursive state estimation: unknown but bounded errors and system input. IEE Trans. Automatic Control AC-13 (1968)
Greenstadt, J.: Variations on variable metric methods. Math. Comput.24, 1–18 (1970)
Tewarson, R.P.: On the use of generalized inverses in function minimization. Computing6, 241–248 (1970)
Spedicato, E.: Stability of Huang's update for the conjugate gradient method. J. Optimization Theory Appl.11, 469–479 (1973)
Greenstadt, J.: Variational derivation of some Broyden-like formulas. Working paper, IBM Scientific Center, Palo Alto, Calif., 1975
Brodlie, K.W., Gourlay, A.R., Greenstadt, Jr.: Rnak-one and rank-two corrections to positive definite matrices expressed in product form. J. Inst. Math. Appl.11, 73–82 (1973)
Spedicato, E.: A bound to the condition number of rank-two updates and applications to the variable metric method. Report CISE-N-174, Milano, 1975
Fletcher, R.: A new approach to variable metric algorithms. Comput. J.13, 317–322 (1970)
Oren, S.S.: Self-scaling variable metric algorithms for unconstrained minimization. Ph.D. Dissertation, Stanford University, 1972
Spedicato, E.: A class of variable metric algorithms derived from invariancy to nonlinear scaling. J. Optimization Theory Appl.20, 315–329 (1976)
Bus, J.C.P.: A comparative study of programs for solving nonlinear systems of equations. Report NW25/75, Stichting Mathematisch Centrum, 1975
Spedicato, E.: Computational experience with Quasi-Newton algorithms for minimization problems of moderately large size. Report CISE-N-175, Milano, 1975
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Spedicato, E., Greenstadt, J. On some classes of variationally derived Quasi-Newton methods for systems of nonlinear algebraic equations. Numer. Math. 29, 363–380 (1978). https://doi.org/10.1007/BF01432875
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01432875