Set separation problems and global optimization.

DOI10.1016/S0362-546X(01)00316-9MaRDI QIDQ1875212zbMATH OpenOpenAlexWikidataFDO

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

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)00316-9, https://www.ncbi.nlm.nih.gov/pmc/articles/5830190

Mathematics Subject Classification ID

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

Recommendations

• Robust separation of multiple sets.
• Separation of two sets by piecewise linear function
• Robust set separation via exponentials.
• The surgical separation of sets
• The best linear separation of two sets

Cited in

(26)

• Bilinear separation of two sets in n-space
• The surgical separation of sets
• Robust separation of multiple sets.
• Robust set separation via exponentials.
• Separation via quadratic functions
• Strict polynomial separation of two sets
• On the combinatorics of the 2-class classification problem
• Conic separation of finite sets. II: The non-homogeneous case
• Algorithms of quasidifferentiable optimization for the separation of point sets
• Numerical search for global solutions in problems of non-symmetric bilinear separability
• On numerical solving the spherical separability problem
• Approximate functions in a problem of sets separation
• Separation of two sets by piecewise linear function
• An approach to classification based on separation of sets by means of several ellipsoids
• The extremal separation of two sets: I. General results
• Linear separation and approximation by minimizing the sum of concave functions of distances
• scientific article; zbMATH DE number 1417717 (Why is no real title available?)
• Robust spherical separation
• Ellipsoidal separation for classification problems
• Max–min separability
• Conic separation of finite sets. I: The homogeneous case
• Supervised data classification via max-min separability
• The best linear separation of two sets
• Algorithms and Computation
• Polyhedral separability through successive LP
• Separating disconnected quadratic level sets by other quadratic level sets

This page was built for publication: Set separation problems and global optimization.

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