Mathematical foundations of nonsmooth embedding methods
DOI10.1007/BF01582256zbMATH Open0728.90084OpenAlexW2086004562MaRDI QIDQ805500FDOQ805500
Authors: Stephen M. Robinson 
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
Recommendations
generalized equationvariational inequality problemHadamard theoremnonsmooth functionsclassical embedding methodscontinuation propertyhomeomorphism theoremsinverse-function theoremstrong Bouligand differentiability
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Variational inequalities (49J40) Fréchet and Gateaux differentiability in optimization (49J50)
Cites Work
- Title not available (Why is that?)
- Monotone (nonlinear) operators in Hilbert space
- 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
- On concepts of directional differentiability
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- Title not available (Why is that?)
Cited In (8)
- Interior point solutions of variational problems and global inverse function theorems
- Sensitivity analysis of composite piecewise smooth equations
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A homotopy continuation method for solving normal equations
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A numerical embedding method for solving the nonlinear optimization problem
- The embedding method for nonsmooth equations
This page was built for publication: Mathematical foundations of nonsmooth embedding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805500)
