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).
Original languageEnglish
Pages (from-to)175-183
JournalSpringer Optimization and Its Applications
Volume87
DOIs
StatePublished - 2014

    Research areas

  • The best linear separation, Linear programming

ID: 5627758