On the intrinsic core of convex cones in real linear spaces

DOI10.1137/19M1283148zbMATH Open1481.90253OpenAlexW3160355202MaRDI QIDQ4989934FDOQ4989934

Authors: C. Günther, Chr. Tammer, Bahareh Khazayel, A. Farajzadeh 

Publication date: 27 May 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1283148

Recommendations

• On relatively solid convex cones in real linear spaces
• A note on convex cones in topological vector spaces
• Vector optimization w.r.t. relatively solid convex cones in real linear spaces
• The intrinsic core and minimal faces of convex sets in general vector spaces
• Algebraic core and convex calculus without topology

zbMATH Keywords

convex conelinear spacevector optimizationseparation theoremPareto efficiencyintrinsic corelinearity spacerelative algebraic interior

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Ordered topological linear spaces, vector lattices (46A40)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Explicitly quasiconvex set-valued optimization
• Vector Optimization
• Cones and duality
• Set-valued Optimization
• 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
• Title not available (Why is that?)
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• On the use of the quasi-relative interior in optimization
• Title not available (Why is that?)
• 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.
• Efficient and weak efficient points in vector optimization with generalized cone convexity
• Title not available (Why is that?)
• Weak and proper efficiency in set-valued optimization on real linear spaces
• Variational Analysis and Applications
• On relatively solid convex cones in real linear spaces
• Unifying local-global type properties in vector optimization
• Regularized nonlinear scalarization for vector optimization problems with PDE-constraints

Cited In (9)

• A Vectorization Scheme for Nonconvex Set Optimization Problems
• Nonlinear strict cone separation theorems in real normed spaces
• Levitin-Polyak well-posedness for vector optimization problems in linear spaces
• Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
• 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
• R-convexity in R-vector spaces
• Vector optimization w.r.t. relatively solid convex cones in real linear spaces
• The intrinsic core and minimal faces of convex sets in general vector spaces

This page was built for publication: On the intrinsic core of 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 Q4989934)