IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-8615-2_11.html
   My bibliography  Save this book chapter

The Best Linear Separation of Two Sets

In: Constructive Nonsmooth Analysis and Related Topics

Author

Listed:
  • V. N. Malozemov

    (Saint Petersburg State University)

  • E. K. Cherneutsanu

    (Saint Petersburg State University)

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

Suggested Citation

  • V. N. Malozemov & E. K. Cherneutsanu, 2014. "The Best Linear Separation of Two Sets," Springer Optimization and Its Applications, in: Vladimir F. Demyanov & Panos M. Pardalos & Mikhail Batsyn (ed.), Constructive Nonsmooth Analysis and Related Topics, edition 127, pages 175-183, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-8615-2_11
    DOI: 10.1007/978-1-4614-8615-2_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xeniya Vladimirovna Grigor’eva, 2016. "Approximate Functions in a Problem of Sets Separation," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 550-572, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4614-8615-2_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.