Closedness of a convex cone and application by means of the end set of a convex set (Q5894261): Difference between revisions
From MaRDI portal
Latest revision as of 11:09, 4 July 2024
scientific article; zbMATH DE number 5945546
Language | Label | Description | Also known as |
---|---|---|---|
English | Closedness of a convex cone and application by means of the end set of a convex set |
scientific article; zbMATH DE number 5945546 |
Statements
Closedness of a convex cone and application by means of the end set of a convex set (English)
0 references
6 September 2011
0 references
The end set \(E[C]\) of a nonempty convex set \(C\subseteq \mathbb{R}^n\) can be defined by \(E[C]:= \text{conv}(\{0\} \cup C)\), and the extent \(e[C]\) by \(e[C]:= \inf \{\|x\| : x\in E[C] \}\) if \(E[C] \neq \emptyset\) and \(e[C]:= \infty\) otherwise. The authors prove new conditions for the closedness of convex cones \(\mathbb{R}_+C\) (generated by \(C\)) in terms of \(E[C]\) and \(e[C]\). For example: For each compact convex set \(C\) with \(e[C]>0\) the cone \(\mathbb{R}_+C\) is closed; a convex cone \(K\) is closed iff there exists a compact convex set \(C\) with \(e[C]>0\) and \(K=\mathbb{R}_+C\). The results are used to obtain a simple formula of the least global error bound and a suitable regularity condition of the set containment problem for sublinear functions. Editorial remark: This paper has been duplicated in the same journal [ibid. 151, No. 3, 633--645 (2011; Zbl 1254.52002)].
0 references
convex cones
0 references
end set of a convex set
0 references
extent of a convex set
0 references
sublinear functions
0 references
least global error
0 references
regularity condition
0 references
set containment problem
0 references
0 references
0 references
0 references
0 references