Vector optimization w.r.t. relatively solid convex cones in real linear spaces
From MaRDI portal
Publication:2139264
DOI10.1007/S10957-021-01976-YzbMATH Open1493.90227OpenAlexW4200200616MaRDI QIDQ2139264FDOQ2139264
Authors: C. Günther, Bahareh Khazayel, Chr. Tammer 
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01976-y
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
scalarizationvector optimizationseparation theoremintrinsic coreHenig proper efficiency(weak) Pareto efficiencygeneralized dilating conesrelatively solid convex cone
Multi-objective and goal programming (90C29) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Programming in abstract spaces (90C48) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Cites Work
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Explicitly quasiconvex set-valued optimization
- Proper efficiency and the theory of vector maximization
- Vector Optimization
- Super efficiency in convex vector optimization
- Title not available (Why is that?)
- Set-valued optimization. An introduction with applications
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Notions of relative interior in Banach spaces
- Title not available (Why is that?)
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- On the use of the quasi-relative interior in optimization
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Duality in Vector Optimization
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Proper efficiency in vector optimization on real linear spaces.
- Density theorems for generalized Henig proper efficiency
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- On the notion of proper efficiency in vector optimization
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Weak and proper efficiency in set-valued optimization on real linear spaces
- Properly optimal elements in vector optimization with variable ordering structures
- Efficiency and proper efficiency in vector maximization with respect to cones
- Henig proper efficiency in vector optimization with variable ordering structure
- Vector optimization and monotone operators via convex duality. Recent advances
- Vector variational inequalities and vector optimization. Theory and applications
- Duality related to approximate proper solutions of vector optimization problems
- On relatively solid convex cones in real linear spaces
- Characterizations via linear scalarization of minimal and properly minimal elements
- Some perspectives on vector optimization via image space analysis
- Unifying local-global type properties in vector optimization
- New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- Scalarization and separation by translation invariant functions. With applications in optimization, nonlinear functional analysis, and mathematical economics
- A new ABB theorem in normed vector spaces
- On the intrinsic core of convex cones in real linear spaces
- Algebraic core and convex calculus without topology
Cited In (10)
- Nonlinear strict cone separation theorems in real normed spaces
- Space tensor conic programming
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Non-conflicting ordering cones and vector optimization in inductive limits
- Vector optimization over cones involving support functions using generalized \((\Phi,\rho)\)-convexity
- On the intrinsic core of convex cones in real linear spaces
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Vectorial penalisation in vector optimisation in real linear-topological spaces
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)
