The Best Linear Separation of Two Sets

V. N. Malozemov () and E. K. Cherneutsanu ()
Additional contact information
V. N. Malozemov: Saint Petersburg State University
E. K. Cherneutsanu: Saint Petersburg State University

A chapter in Constructive Nonsmooth Analysis and Related Topics, 2014, pp 175-183 from Springer

Abstract: 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).

Keywords: The best linear separation; Linear programming (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-8615-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461486152

DOI: 10.1007/978-1-4614-8615-2_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().