Orthogonal Projections on Convex Sets for Newton-Like Methods
Author:
- Stanisław M. GrzegórskiSGStanisław M. Grzegórski
- 1 December 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 22 (6) , 1208-1219
Abstract
This paper develops the fixed “almost“ least-change secant methods for solving of nonlinear problems. The presented results generalize and extend some results given by Dennis and Walker [SIAM J. Numer., Anal., 18 (1981), pp. 949–987]. Among other things, multilevel update algorithms are described.Keywords
This publication has 14 references indexed in Scilit:
- Convergence Theorems for Least-Change Secant Update MethodsSIAM Journal on Numerical Analysis, 1981
- Least Change Secant Updates for Quasi-Newton MethodsSIAM Review, 1979
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- Update Methods for Highly Structured Systems of Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- 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
- The convergence of an algorithm for solving sparse nonlinear systemsMathematics of Computation, 1971
- A New Algorithm for Unconstrained Optimization1970
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965