Newton’s method for generalized equations: a sequential implicit function theorem

In an extension of Newton’s method to generalized equations, we carry further the implicit function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming Vol. 123; no. 1; pp. 139 - 159
Main Authors: Dontchev, A. L., Rockafellar, R. T.
Format: Journal Article Conference Proceeding
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.05.2010
Springer
Springer Nature B.V
Subjects:
ISSN:0025-5610, 1436-4646
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In an extension of Newton’s method to generalized equations, we carry further the implicit function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space. An inverse function version of this result shows that the strong regularity of the mapping associated with the Newton sequences is equivalent to the strong regularity of the generalized equation mapping.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-009-0322-5