Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets

DOI10.1007/s11117-015-0339-3zbMath1346.90805OpenAlexW786661707MaRDI QIDQ259788

Nguyen Le Hoang Anh

Publication date: 18 March 2016

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-015-0339-3

zbMATH Keywords

set-valued optimizationhigher-order optimality conditionordering coneproper Henig solutionvariational set

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items (3)

Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Variational sets and asymptotic variational sets of proper perturbation map in parametric vector optimization

Cites Work

• Unnamed Item
• Variational sets of perturbation maps and applications to sensitivity analysis for constrained vector optimization
• On higher-order sensitivity analysis in nonsmooth vector optimization
• Variational sets: calculus and applications to nonsmooth vector optimization
• Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization
• 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
• Higher-order optimality conditions for set-valued optimization
• 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
• Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Generalized differential calculus for nonsmooth and set-valued mappings
• Near-subconvexlikeness in vector optimization with set-valued functions
• Separation theorem based on the quasirelative interior and application to duality theory
• Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
• Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives
• Contingent derivatives of set-valued maps and applications to vector optimization
• Generalized Higher-Order Optimality Conditions for Set-Valued Optimization under Henig Efficiency
• Implicit Functions and Solution Mappings
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Super Efficiency in Vector Optimization
• Set-valued derivatives of multifunctions and optimality conditions
• Some Calculus Rules for Contingent Epiderivatives
• GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS
• Set-valued analysis

This page was built for publication: Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets