\(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions
From MaRDI portal
Publication:414494
DOI10.1016/j.na.2012.01.030zbMath1266.90153MaRDI QIDQ414494
Jian-Wen Peng, Zhi-Ang Zhou, Yang, Xinmin
Publication date: 11 May 2012
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.2012.01.030
optimality conditions; set-valued map; \(\varepsilon \)-strict subdifferential; near-subconvexlikeness
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
Cites Work
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- \(\epsilon\)-solutions in vector minimization problems
- Conjugate maps and duality in multiobjective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Lagrangian duality for minimization of nonconvex multifunctions
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Approximate saddle-point theorems in vector optimization
- Strong efficiency in a locally convex space
- Necessary conditions for super minimizers in constrained multiobjective optimization
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Set-valued optimization in welfare economics
- Proper Efficient Points for Maximizations with Respect to Cones
- Super efficiency in convex vector optimization
- The Strictly Efficient Subgradient of Set-Valued Optimisation
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
