Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
From MaRDI portal
Publication:555821
DOI10.1016/j.jmaa.2004.10.001zbMath1112.90077OpenAlexW1983052400MaRDI QIDQ555821
Publication date: 10 June 2005
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.10.001
Henig efficient solutionGlobally proper efficient solutionOptimality conditionQuasi interiorSet-valued vector optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items (40)
Existence results for strong vector equilibrium problems and their applications ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ Characterizations via linear scalarization of minimal and properly minimal elements ⋮ Super-efficiency of vector optimization in Banach spaces ⋮ Globally proper saddle point in ic-cone-convexlike set-valued optimization problems ⋮ A new kind of inner superefficient points ⋮ Sharp efficiency for vector equilibrium problems on Banach spaces ⋮ Scalarization of Henig properly efficient points in locally convex spaces ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Connectedness of Henig weakly efficient solution set for set-valued optimization problems ⋮ Optimality conditions and scalarization of approximate quasi weak efficient solutions for vector equilibrium problem ⋮ Unnamed Item ⋮ Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints ⋮ Existence results for proper efficient solutions of vector equilibrium problems and applications ⋮ Henig globally efficiency for set-valued optimization and vector variational inequality ⋮ Second-order necessary and sufficient optimality conditions for constrained vector equilibrium problem with applications ⋮ Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone ⋮ The Lagrange multiplier rule for super efficiency in vector optimization ⋮ Optimality conditions for vector equilibrium problems ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ Scalarization and optimality conditions for vector equilibrium problems ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps ⋮ Optimality conditions for strong vector equilibrium problems under a weak constraint qualification ⋮ The Fermat rule for multifunctions for super efficiency ⋮ On the use of the quasi-relative interior in optimization ⋮ Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ OPTIMALITY OF GLOBAL PROPER EFFICIENCY FOR CONE-ARCWISE CONNECTED SET-VALUED OPTIMIZATION USING CONTINGENT EPIDERIVATIVE ⋮ Henig proper subdifferential of set-valued maps ⋮ Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications ⋮ New notions of proper efficiency in set optimization with the set criterion ⋮ Connectedness of the approximate solution sets for set optimization problems ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On programming when the positive cone has an empty interior
- Existence and Lagrangian duality for maximization of set-valued functions
- Proper efficiency with respect to cones
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Partially finite convex programming. II: Explicit lattice models
- Generalizations of Slater's constraint qualification for infinite convex programs
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- The optimality conditions for vector optimization of set-valued maps
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Optimization of set-valued functions
- Proper efficiency in locally convex topological vector spaces
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- The domination property for efficiency in locally convex spaces
- Lagrangian duality for minimization of nonconvex multifunctions
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Duality for vector optimization of set-valued functions
- Ordered linear spaces
- Contingent derivatives of set-valued maps and applications to vector optimization
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A simple constraint qualification in infinite dimensional programming
- Super Efficiency in Vector Optimization
- Set-valued derivatives of multifunctions and optimality conditions
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Optimality conditions for maximizations of set-valued functions
- Efficiency and Henig efficiency for vector equilibrium problems.
This page was built for publication: Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
