Vector optimization w.r.t. relatively solid convex cones in real linear spaces
From MaRDI portal
Publication:2139264
Motivated by possible applications in fields like optimal control, approximation theory, or duality theory, the authors introduce a new Henig-type proper efficiency concept with respect to generalized dilating cones whose intrinsic cores are nonempty, and characterize the (weak/proper) efficiency sets of vector optimization problems under generalized convexity assumptions. Well-chosen examples illustrate the theoretical achievements.
Recommendations
- scientific article; zbMATH DE number 1786289
- Cone characterizations of approximate solutions in real vector optimization
- Vector optimization problem and generalized convexity
- On vector optimization problems and vector variational inequalities using convexificators
- On convex vector optimisation
- Optimality conditions in vector optimization problems with a nonsolid cone of positive elements
- scientific article; zbMATH DE number 2143157
- Generalized convexity and some applications to vector optimization
- Well-posedness and convexity in vector optimization
- scientific article; zbMATH DE number 2226570
Cites work
- A new ABB theorem in normed vector spaces
- Algebraic core and convex calculus without topology
- Characterizations via linear scalarization of minimal and properly minimal elements
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Density theorems for generalized Henig proper efficiency
- Duality in Vector Optimization
- Duality related to approximate proper solutions of vector optimization problems
- Efficiency and proper efficiency in vector maximization with respect to cones
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Explicitly quasiconvex set-valued optimization
- Henig proper efficiency in vector optimization with variable ordering structure
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- Notions of relative interior in Banach spaces
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- On relatively solid convex cones in real linear spaces
- On the intrinsic core of convex cones in real linear spaces
- On the notion of proper efficiency in vector optimization
- On the use of the quasi-relative interior in optimization
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Proper efficiency and the theory of vector maximization
- Proper efficiency in vector optimization on real linear spaces.
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Properly optimal elements in vector optimization with variable ordering structures
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Scalarization and separation by translation invariant functions. With applications in optimization, nonlinear functional analysis, and mathematical economics
- Set-valued optimization. An introduction with applications
- Some perspectives on vector optimization via image space analysis
- Super efficiency in convex vector optimization
- Unifying local-global type properties in vector optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Vector Optimization
- Vector optimization and monotone operators via convex duality. Recent advances
- Vector variational inequalities and vector optimization. Theory and applications
- Weak and proper efficiency in set-valued optimization on real linear spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
Cited in
(14)- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Vector optimization over cones involving support functions using generalized (,)-convexity
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Non-conflicting ordering cones and vector optimization in inductive limits
- On the intrinsic core of convex cones in real linear spaces
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Nonlinear strict cone separation theorems in real normed spaces
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Proper subdifferential of set-valued maps and its applications in linear spaces
- Bishop-Phelps type scalarization for vector optimization in real topological-linear spaces
- Existence and continuity of solutions to vector equilibrium problems via non-linear scalarization
- Internal structure and analytical representation of preference relations defined on infinity-dimensional real vector spaces
- Space tensor conic programming
This page was built for publication: Vector optimization w.r.t. relatively solid convex cones in real linear spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139264)
