Newton's method for generalized equations: a sequential implicit function theorem
DOI10.1007/s10107-009-0322-5zbMath1190.49024OpenAlexW1974950672MaRDI QIDQ849328
Asen L. Dontchev, R. Tyrrell Rockafellar
Publication date: 25 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0322-5
variational inequalitiesNewton's methodperturbationsstrong regularityimplicit function theoremsvariational analysisgeneralized equationsinverse function theorems
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (27)
Cites Work
- Unnamed Item
- Unnamed Item
- Robinson's implicit function theorem and its extensions
- Newton's method for a class of nonsmooth functions
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Stability of a cubically convergent method for generalized equations
- Uniform Convergence and Mesh Independence of Newton's Method for Discretized Variational Problems
- Ample Parameterization of Variational Inclusions
- Stability of inclusions: characterizations via suitable Lipschitz functions and algorithms
- Implicit Functions and Solution Mappings
- Strongly Regular Generalized Equations
This page was built for publication: Newton's method for generalized equations: a sequential implicit function theorem