Robust set separation via exponentials.

DOI10.1016/S0362-546X(01)00319-4MaRDI QIDQ1875215zbMATH OpenOpenAlexWikidataFDO

Authors Yelena V. Dandurova, Lana E. Yeganova, James E. Falk

Publication date 26 August 2004

Published in Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0362-546x(01)00319-4, https://europepmc.org/articles/pmc5830182

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Review text

Given a pair of finite disjoint sets \(A\) and \(B\) in Euclidean \(n\)-space, a fundamental problem with numerous applications is to efficiently determine a hyperplane \(H(\omega,\gamma)\) which separates these sets when they are separable, or `nearly' separates them when they are not. We seek a hyperplane that separates them in the sense that a measure of the Euclidean distance between the separating hyperplane and all of the points is as large as possible. This is done by `weighting' points relative to \(A\cup B\) according to their distance to \(H(\omega,\gamma)\), with the closer points getting a higher weight, but still taking into account the point distant from \(H(\omega,\gamma)\). The negative exponential is chosen for that purpose. In this paper we examine the optimization problem associated with this set separation problem and characterize it (convex or non-convex).

Recommendations

• Set separation problems and global optimization.
• The surgical separation of sets
• Robust separation of multiple sets.
• Publication:4944182
• Separation of two sets by piecewise linear function

Cited in

(5)

• The surgical separation of sets
• Robust separation of multiple sets.
• Set separation problems and global optimization.
• Optimal expected-distance separating halfspace
• scientific article; zbMATH DE number 1417717 (Why is no real title available?)

This page was built for publication: Robust set separation via exponentials.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1875215)