A cone separation theorem
From MaRDI portal
Cites work
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- State Constraints in Convex Control Problems of Bolza
- The structure of admissible points with respect to cone dominance
Cited in
(18)- Proper efficiency with respect to cones
- About separation by cones
- Lexicographical separation in \({\mathbb{R}}^ n\)
- Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results
- Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories
- Separation theorems for nonconvex sets and application in optimization
- On the density of Henig efficient points in locally convex topological vector spaces
- An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces
- Approximation of the efficient point set by perturbation of the ordering cone
- Approximating families of cones and proper efficiency in vector optimization
- Approximate efficiency in set-valued optimization with variable order
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches
- Limit behavior of approximate proper solutions in vector optimization
- Value functions, domination cones and proper efficiency in multicriteria optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Nonlinear strict cone separation theorems in real normed spaces
- Symmetric and non-symmetric cone separation via Bishop-Phelps cones in normed spaces
- Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems
This page was built for publication: A cone separation theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148815)
