Convex sets and minimal sublinear functions
From MaRDI portal
Abstract: We show that, given a closed convex set containing the origin in its interior, the support function of the set is the pointwise smallest among all sublinear functions such that .
Recommendations
Cited in
(21)- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A geometric approach to cut-generating functions
- Minimal pairs representing selections of four linear functions in \(\mathbb{R}^3\)
- On minimal valid inequalities for mixed integer conic programs
- Convex Sets and Subharmonicity of the Distance Function
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- On Closed Sets Having A Least Element
- Minimum recession-compatible subsets of closed convex sets
- The smallest convex extensions of a convex function
- scientific article; zbMATH DE number 2121696 (Why is no real title available?)
- Minsum location extended to gauges and to convex sets
- Convex analysis in \(\mathbb{Z}^n\) and applications to integer linear programming
- On a support function on a convex cone
- Intersection Disjunctions for Reverse Convex Sets
- Cut-generating functions and S-free sets
- Convergence of Minimal Sets in Convex Vector Optimization
- Nonunique lifting of integer variables in minimal inequalities
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Monoidal strengthening and unique lifting in MIQCPs
- Minimization of a convex functional on a class of sets in a measure space
This page was built for publication: Convex sets and minimal sublinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997129)