On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
DOI10.1007/BF01447734zbMath0742.90086OpenAlexW4238293458MaRDI QIDQ1178308
Nguyen Dong Yen, Pham Huy Dien
Publication date: 26 June 1992
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01447734
implicit function theoremsinclusion constraintslocally Lipschitz set-valued mapsstability of optimization problems
Sensitivity, stability, parametric optimization (90C31) Set-valued functions (26E25) Programming in abstract spaces (90C48) Implicit function theorems, Jacobians, transformations with several variables (26B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
- Further properties of Lagrange multipliers in nonsmooth optimization
- Regularity and stability for the mathematical programming problem in Banach spaces
- On the variational principle
- Further properties of the regularity of inclusion systems
- Optimization and nonsmooth analysis
- Regularity and Stability for Convex Multivalued Functions
- Clarke's tangent cones and the boundaries of closed sets in Rn
- Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
This page was built for publication: On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints