Separation of convex sets via barrier cones (Q778148)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Separation of convex sets via barrier cones |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separation of convex sets via barrier cones |
scientific article |
Statements
Separation of convex sets via barrier cones (English)
0 references
1 July 2020
0 references
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint, closed, and convex set by a closed hyperplane. The paper contains results on the (strong) separation of convex sets. The author develops a new result on the strong separation by imposing an assumption on the barrier cones of the sets. Necessary and/or sufficient conditions for a closed convex subset in a normed space to have the strong separation property are provided. The results are applied to a class of convex optimization problems.
0 references
convex set
0 references
separation theorem
0 references
barrier cone
0 references
recession cone
0 references
set having the strong separation property
0 references
0.8222653269767761
0 references
0.8053514957427979
0 references
0.8015881180763245
0 references
