Separation of two sets by piecewise linear function

MaRDI QIDQ3534131zbMATH OpenFDO

Authors Julien Ugon, A. M. Bagirov

Publication date 3 November 2008

zbMATH Keywords

classificationnonsmooth optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Set separation problems and global optimization.
• On the problem polyhedral separability: a numerical solution
• Max–min separability
• Separation via polyhedral conic functions
• The best linear separation of two sets

Cited in

(18)

• Bilinear separation of two sets in n-space
• The surgical separation of sets
• Robust separation of multiple sets.
• Set separation problems and global optimization.
• Robust set separation via exponentials.
• Strict polynomial separation of two sets
• Algorithms of quasidifferentiable optimization for the separation of point sets
• Approximate functions in a problem of sets separation
• An approach to classification based on separation of sets by means of several ellipsoids
• The extremal separation of two sets: I. General results
• scientific article; zbMATH DE number 1417717 (Why is no real title available?)
• Separating overlapped intervals on a line
• Identification of point sets by quasidifferentiable functions
• Ellipsoidal separation for classification problems
• Max–min separability
• Supervised data classification via max-min separability
• scientific article; zbMATH DE number 2233588 (Why is no real title available?)
• The best linear separation of two sets

This page was built for publication: Separation of two sets by piecewise linear function

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