New generalized convexity notion for set-valued maps and application to vector optimization

DOI10.1007/S10957-004-1716-4MaRDI QIDQ1781867zbMATHOpenAlexFDO

Authors P. H. Sach

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

zbMATH Keywords

efficiencygeneralized convexityset-valued mapsalternative theoremsBenson proper efficiency

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Set-valued and variational analysis (49J53) Convex functions and convex programs in convex geometry (52A41)

Recommendations

• Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
• The optimality conditions for vector optimization of set-valued maps
• Nearly subconvexlike set-valued maps and vector optimization problems
• Generalized convexity and some applications to vector optimization
• Some results on vector optimization of set-valued maps
• On generalized vector variational inequalities with set-valued mappings
• Conic set-valued maps in vector optimization
• Generalized Stampacchia vector variational-like inequalities and vector optimization problems involving set-valued maps
• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
• Nonconvex vector optimization of set-valued mappings.

Cites work

• A characterization of proper minimal points as solutions of sublinear optimization problems
• A theorem of the alternative and its application to the optimization of set-valued maps
• Benson proper efficiency in the vector optimization of set-valued maps
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Convexlike alternative theorems and mathematical programming
• Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
• Inequality systems and optimization
• Lagrange multipliers and saddle points in multiobjective programming
• Minimax Theorems
• Near-subconvexlikeness in vector optimization with set-valued functions
• Nearly subconvexlike set-valued maps and vector optimization problems
• Optimality conditions for vector optimisation with set-valued maps
• Theorems of the alternative and optimization with set-valued maps

Cited in

(36)

• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
• \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
• A new kind of inner superefficient points
• The relationship between ic-cone-convexness and nearly cone-subconvexlikeness
• Topological properties of Henig globally efficient solutions of set-valued problems
• Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
• Polar conic set-valued map in vector optimization. Continuity and derivability
• A note on ``Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality
• Moreau-Rockafellar theorems for nonconvex set-valued maps
• Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
• Existence theorems for set optimization problems
• Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
• Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
• ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
• 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
• Optimality and duality in set-valued optimization utilizing limit sets
• Prederivatives of convex set-valued maps and applications to set optimization problems
• \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
• Approximate duality for vector quasi-equilibrium problems and applications
• Characterizations of proper cone quasiconvexity and cone semicontinuity via nonlinear scalarization functions for vector-valued maps
• Near-subconvexlikeness in vector optimization with set-valued functions
• Set Optimization—A Rather Short Introduction
• The semi-\(E\) cone convex set-valued map and its applications
• Second-order \(M\)-composed tangent derivative and its applications
• A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces
• On super efficiency in set-valued optimization
• Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
• The Strictly Efficient Subgradient of Set-Valued Optimisation
• The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces
• Approximate Benson efficient solutions for set-valued equilibrium problems
• The optimality conditions of weak efficient solutions for the optimization problem of a class of generalized convex set-valued mapping
• New second-order tangent epiderivatives and applications to set-valued optimization
• Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems
• Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization
• Optimality conditions for strictly efficient solutions in set-valued optimization

This page was built for publication: New generalized convexity notion for set-valued maps and application to vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781867)