- Title
- Max-min separability
- Creator
- Bagirov, Adil
- Date
- 2005
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/56752
- Identifier
- vital:67
- Identifier
-
https://doi.org/10.1080/10556780512331318263
- Identifier
- ISSN:1055-6788
- Abstract
- We consider the problem of discriminating two finite point sets in the n-dimensional space by a finite number of hyperplanes generating a piecewise linear function. If the intersection of these sets is empty, then they can be strictly separated by a max-min of linear functions. An error function is introduced. This function is nonconvex piecewise linear. We discuss an algorithm for its minimization. The results of numerical experiments using some real-world datasets are presented, which show the effectiveness of the proposed approach.; C1
- Publisher
- Taylor & Francis
- Relation
- Optimization Methods and Software Vol. 20, no. 2-3 (2005), p. 271-290
- Rights
- CIAO
- Rights
- Copyright Taylor and Francis
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0103 Numerical and Computational Mathematics; Classification; Nonconvex optimization; Nonsmooth optimization; Separability
- Full Text
- Reviewed
- Hits: 2043
- Visitors: 2510
- Downloads: 428
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | DS1 | Final Version | 165 KB | Adobe Acrobat PDF | View Details Download |