Fixed point theorem in nonsmooth analysis and its applications
DOI10.1080/01630569508816607zbMath0881.49007OpenAlexW1976681967MaRDI QIDQ4844882
Publication date: 17 February 1998
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569508816607
nonsmooth optimizationimplicit function theoremsClarke subdifferentialKakutani fixed point theoremnonsmooth functionsquasidifferentiable and codifferentiable functions
Nonsmooth analysis (49J52) Set-valued functions (26E25) Fixed-point theorems (47H10) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Implicit function theorems, Jacobians, transformations with several variables (26B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications in quasidifferentiable optimization
- General constraint qualifications in nondifferentiable programming
- Mean value theorems and sufficient optimality conditions for nonsmooth functions
- Functional analysis (basic ideas)
- On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
- On the inverse function theorem
- A generalization of Brouwer's fixed point theorem
- Optimization and nonsmooth analysis
- On locally-Lipschitz quasi-differentiate functions in Banach-spaces
- On the mean value theorem
- Mean value theorems in nonsmooth analysis
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- A constraint qualification in quasidifferentiable programming
- On equivalent quasidifferentials in the two dimensional case
- Mean value properties of nondifferentiation functions and their application in nonsmooth analysis
- On Optimality Conditions in Quasidifferentiable Optimization
- Convex Analysis
- Implicit Functions and Optimization Problems without Continuous Differentiability of the Data