Conic separation of finite sets. II: The non-homogeneous case (Q2922477)
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: Conic separation of finite sets. II: The non-homogeneous case |
scientific article; zbMATH DE number 6353713
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conic separation of finite sets. II: The non-homogeneous case |
scientific article; zbMATH DE number 6353713 |
Statements
10 October 2014
0 references
conical separation
0 references
revolution cone
0 references
alternating minimization
0 references
DC programming
0 references
classification
0 references
Conic separation of finite sets. II: The non-homogeneous case (English)
0 references
The problem of discriminating between a pair of finite sets by means of a revolution cone is considered. The values of the aperture coefficient, the axis and the apex should be selected to meet certain optimal selection criteria. A DC programming method is developed to solve the optimization problem respective to the original separation problem where DC means difference convex -- an approach to non-convex optimization.NEWLINENEWLINE For Part I see [ibid. 21, No. 1, 1--28 (2014; Zbl 1401.90150)].
0 references
