Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones
DOI10.1007/s11117-016-0444-yzbMath1379.49020OpenAlexW2518245154MaRDI QIDQ1683241
Nguyen Le Hoang Anh, Phan Quoc Khanh
Publication date: 6 December 2017
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-016-0444-y
radial derivativesset-valued optimizationPareto solutionsgeneralized subconvexlikenesshigher-order Karush-Kuhn-Tucker conditionsnonsolid ordering conesquasi-relative efficient solutions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53) Derivatives of functions in infinite-dimensional spaces (46G05) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Cites Work
- Unnamed Item
- Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Variational sets: calculus and applications to nonsmooth vector optimization
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- Calculus rules for derivatives of multimaps
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Higher order optimality conditions for Henig efficient solutions in set-valued optimization
- On programming when the positive cone has an empty interior
- Optimality conditions for weak and firm efficiency in set-valued optimization
- Higher-order Mond-Weir duality for set-valued optimization
- Higher-order optimality conditions for set-valued optimization
- Variational sets of multivalued mappings and a unified study of optimality conditions
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Multiobjective optimization problems with equilibrium constraints
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Higher order weak epiderivatives and applications to duality and optimality conditions
- Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization
- Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Partially finite convex programming. II: Explicit lattice models
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Generalized differential calculus for nonsmooth and set-valued mappings
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Higher-order optimality conditions for proper efficiency in nonsmooth vector optimization using radial sets and radial derivatives
- Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives
- First-order optimality conditions in set-valued optimization
- Strong KKT, Second Order Conditions and Non-solid Cones in Vector Optimization
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Variational Analysis
- GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
- Set-valued Optimization
- Set-valued analysis