Abstract
Consider the problem of the best approximate separation of two finite sets in the linear case. This problem is reduced to the problem of nonsmooth optimization, analyzing which we use all power of the linear programming theory. Ideologically we follow Bennett and Mangassarian (Optim. Meth. Software 1, 23–34 1992).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bennett, K.P., Mangassarian, O.L.: Robust linear programming discrimination of two linearly inseparable sets. Optim. Meth. Software 1, 23–34 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Malozemov, V.N., Cherneutsanu, E.K. (2014). The Best Linear Separation of Two Sets. In: Demyanov, V., Pardalos, P., Batsyn, M. (eds) Constructive Nonsmooth Analysis and Related Topics. Springer Optimization and Its Applications, vol 87. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8615-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8615-2_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8614-5
Online ISBN: 978-1-4614-8615-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)