Optimality conditions for the difference of convex set-valued mappings
From MaRDI portal
Publication:850590
DOI10.1007/s11117-005-2786-8zbMath1151.90536MaRDI QIDQ850590
Publication date: 3 November 2006
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-005-2786-8
subdifferential; multiobjective optimization; optimality condition; support function; cone-convex mapping
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
On the optimality conditions for D.C. vector optimization problems, Necessary optimality conditions of a D.C. set-valued bilevel optimization problem, Optimality conditions for vector optimization problems with difference of convex maps, Subdifferential and optimality conditions for the difference of set-valued mappings, Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Theory of multiobjective optimization
- Conjugate maps and duality in multiobjective optimization
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- On subdifferentials of set-valued maps
- Optimization of set-valued functions
- Contingent epiderivatives and set-valued optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Optimality conditions in non-convex set-valued optimization
- \(K\)-epiderivatives for set-valued functions and optimization
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- Sufficient optimality condition for vector optimization problems under D.C. data
- On the regularity condition for vector programming problems
- Kolmogorov conditions for vectorial optimization problems
- A formula on the approximate subdifferential of the difference of convex functions
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
- Optimality conditions for maximizations of set-valued functions
- Simplified optimality conditions for minimizing the difference of vector-valued functions
