Maximal Separation Theorems for Convex Sets
From MaRDI portal
Publication:5549610
DOI10.2307/1994833zbMath0164.52702OpenAlexW4248973088MaRDI QIDQ5549610
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/1994833
Related Items
Unnamed Item, A convex-like duality scheme for quasi-convex programs, Weak \(q\)-concavity conditions for CR manifolds, Dual gauge programs, with applications to quadratic programming and the minimum-norm problem, Evenly convex sets, and evenly quasiconvex functions, revisited, Evenly convex credal sets, Remarks on separation of convex sets, fixed-point theorem, and applications in theory of linear operators, Conjugate functionals and level sets, A theorem on strict separability of convex polyhedra and its applications in optimization, Conjugacy in quasi-convex programming, Ein Beitrag zur quasi-konvexen Optimierung in topologischen linearen Räumen, Frank separation of two convex sets and Hahn-Banach theorem, Step-affine functions, halfspaces, and separation of convex sets with applications to convex optimization problems, Convergence in the Semimartingale Topology and Constrained Portfolios, Support and separation properties of convex sets in finite dimension, Permutations of $\mathbb {Z}^d$ with restricted movement, Best approximation and optimization
Cites Work