Orthogonal Projections on Convex Sets for Newton-Like Methods

Orthogonal Projections on Convex Sets for Newton-Like Methods

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 de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on numerical analysis 1985-12, Vol.22 (6), p.1208-1219
1. Verfasser: Grzegorski, Stanislaw M.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Exact sciences and technology
Hypotheses
Jacobians
Mathematical theorems
Mathematics
Methods
Newtons method
Nonlinear equations
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Perceptron convergence procedure
Sciences and techniques of general use
Secant function
Sparsity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0036-1429
1095-7170
DOI:10.1137/0722074