Clarke coderivatives of efficient point multifunctions in parametric vector optimization
DOI10.1016/j.na.2010.08.042zbMath1207.49031OpenAlexW2037767943MaRDI QIDQ603038
Publication date: 5 November 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.08.042
sensitivity analysisClarke normal coneefficient point multifunctionparametric vector optimizationClarke coderivative
Sensitivity, stability, well-posedness (49K40) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items (17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Clarke epiderivatives of parametric vector optimization problems
- Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Super-efficiency of vector optimization in Banach spaces
- Subgradients of marginal functions in parametric mathematical programming
- Coderivatives of frontier and solution maps in parametric multiobjective optimization
- Stability of semi-infinite vector optimization problems under functional perturbations
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- Sensitivity analysis in multiobjective optimization
- Proto-differentiability of set-valued mappings and its applications in optimization
- Contingent derivative of the perturbation map in multiobjective optimization
- Optimality conditions for set-valued optimization problems
- Sensitivity analysis in convex vector optimization
- Characterization of stability for cone increasing constraint mappings
- The Ekeland variational principle for set-valued maps involving coderivatives
- Recent contributions to linear semi-infinite optimization
- Sensitivity analysis in vector optimization
- Sensitivity analysis in parametrized convex vector optimization
- Necessary conditions for super minimizers in constrained multiobjective optimization
- On sensitivity analysis in vector optimization
- Qualification and optimality conditions for dc programs with infinite constraints
- The Lagrange multiplier rule for super efficiency in vector optimization
- Softness, sleekness and regularity properties in nonsmooth analysis
- The Fermat rule for multifunctions for super efficiency
- The Fermat rule for multifunctions on Banach spaces
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Calmness for L-Subsmooth Multifunctions in Banach Spaces
- Stability and Sensitivity Analysis in Convex Vector Optimization
- Variational Analysis
- New Farkas-type constraint qualifications in convex infinite programming
- Set-valued analysis
- On various notions of regularity of sets in nonsmooth analysis
This page was built for publication: Clarke coderivatives of efficient point multifunctions in parametric vector optimization