Seperability of Star-Shaped Sets and its Application to an Optimization Problem

1997

Closed access Metadata (CSL-JSON)
DOI 10.1080/02331939708844310
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In this paper we deal with a separation problem of stat-shaped sets. It is shown that under natural assumptions two star-shaped subsets of n-dimensional Euclidean space R ncan be separated by a finite set of linear functionals. The number of this functionals is determined by the dimension of the space R n The separation theorem for star-shaped sets is used in studying of global minimum conditions