×

zbMATH — the first resource for mathematics

Nonsmooth equations: Motivation and algorithms. (English) Zbl 0784.90082
The paper is devoted to the generalization of Newton-type methods for solving nonsmooth equations. The authors give a generalization of the Dennis-Moré characterization of superlinearly converging quasi-Newton algorithms for semismooth mappings. They also establish the global convergence of a Gauss-Newton type algorithm for mappings satisfying some generalized regularity properties.

MSC:
90C30 Nonlinear programming
49J52 Nonsmooth analysis
26B10 Implicit function theorems, Jacobians, transformations with several variables
90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
49J40 Variational inequalities
PDF BibTeX XML Cite
Full Text: DOI