Mathematical foundations of nonsmooth embedding methods
From MaRDI portal
Publication:805500
DOI10.1007/BF01582256zbMath0728.90084OpenAlexW2086004562MaRDI QIDQ805500
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582256
variational inequality problemgeneralized equationnonsmooth functionsHadamard theoremclassical embedding methodscontinuation propertyhomeomorphism theoremsinverse-function theoremstrong Bouligand differentiability
Nonlinear programming (90C30) Variational inequalities (49J40) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50)
Related Items (7)
A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification ⋮ A numerical embedding method for solving the nonlinear optimization problem ⋮ Solution of monotone complementarity problems with locally Lipschitzian functions ⋮ Sensitivity analysis of composite piecewise smooth equations ⋮ NE/SQP: A robust algorithm for the nonlinear complementarity problem ⋮ The embedding method for nonsmooth equations ⋮ A homotopy continuation method for solving normal equations
Cites Work
- Monotone (nonlinear) operators in Hilbert space
- On concepts of directional differentiability
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- On the basic theorem of complementarity
- Unnamed Item
- Unnamed Item
This page was built for publication: Mathematical foundations of nonsmooth embedding methods