New generalized convexity notion for set-valued maps and application to vector optimization
From MaRDI portal
Publication:1781867
DOI10.1007/s10957-004-1716-4zbMath1090.90174OpenAlexW2089088151MaRDI QIDQ1781867
Publication date: 9 June 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-1716-4
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Set-valued and variational analysis (49J53) Convex functions and convex programs in convex geometry (52A41)
Related Items (31)
Approximate weakly efficient solutions of set-valued vector equilibrium problems ⋮ Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative ⋮ A note on ``Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality ⋮ Existence theorems for set optimization problems ⋮ The Strictly Efficient Subgradient of Set-Valued Optimisation ⋮ On super efficiency in set-valued optimization ⋮ Globally proper saddle point in ic-cone-convexlike set-valued optimization problems ⋮ A new kind of inner superefficient points ⋮ Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems ⋮ Unnamed Item ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Optimality and duality in set-valued optimization utilizing limit sets ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ New second-order tangent epiderivatives and applications to set-valued optimization ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ The relationship between ic-cone-convexness and nearly cone-subconvexlikeness ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Second-Order M-Composed Tangent Derivative and Its Applications ⋮ Set Optimization—A Rather Short Introduction ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems
Cites Work
- Nearly subconvexlike set-valued maps and vector optimization problems
- Inequality systems and optimization
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Benson proper efficiency in the vector optimization of set-valued maps
- A theorem of the alternative and its application to the optimization of set-valued maps
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Lagrange multipliers and saddle points in multiobjective programming
- Near-subconvexlikeness in vector optimization with set-valued functions
- Theorems of the alternative and optimization with set-valued maps
- Convexlike alternative theorems and mathematical programming
- Optimality conditions for vector optimisation with set-valued maps
- Minimax Theorems
This page was built for publication: New generalized convexity notion for set-valued maps and application to vector optimization
