On the intrinsic core of convex cones in real linear spaces
From MaRDI portal
(Redirected from On the intrinsic core of convex cones in real linear spaces)
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
Cites work
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- Cones and duality
- Convex Analysis
- Duality in Vector Optimization
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Explicitly quasiconvex set-valued optimization
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3884831 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3496896 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1755834 (Why is no real title available?)
- scientific article; zbMATH DE number 944037 (Why is no real title available?)
- Notions of relative interior in Banach spaces
- On relatively solid convex cones in real linear spaces
- On the use of the quasi-relative interior in optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Proper efficiency in vector optimization on real linear spaces.
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Regularized nonlinear scalarization for vector optimization problems with PDE-constraints
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Set-valued optimization. An introduction with applications
- Unifying local-global type properties in vector optimization
- Variational analysis and applications
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Vector Optimization
- 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
(17)- On relatively solid convex cones in real linear spaces
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- R-convexity in R-vector spaces
- The intrinsic core and minimal faces of convex sets in general vector spaces
- Algebraic core and convex calculus without topology
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- On gauge functions for convex cones with possibly empty interiors
- 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
- 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
- Internal structure of convex sets and their faces
- Symmetric and non-symmetric cone separation via Bishop-Phelps cones in normed spaces
- Infinite-dimensional convex cones: internal geometric structure and analytical representation
- Bishop-Phelps type scalarization for vector optimization in real topological-linear spaces
- Internal structure and analytical representation of preference relations defined on infinity-dimensional real 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)
