Strict polynomial separation of two sets

DOI10.1134/S1063454119020109MaRDI QIDQ2289370zbMATH OpenOpenAlexFDO

Authors A. V. Plotkin, V. N. Malozemov

Publication date 28 January 2020

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1063454119020109

zbMATH Keywords

linear programmingmathematical diagnosticsstrict linear separationstrict polynomial separation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• scientific article; zbMATH DE number 2233588
• Separation via polyhedral conic functions
• Set separation problems and global optimization.
• Polyhedral separability through successive LP
• Separation of two sets by piecewise linear function

Cited in

(1)

• On the shapes of rational lemniscates

Describes a project that uses

Uses Software

• ElemStatLearn
• LIBSVM
• UCI

This page was built for publication: Strict polynomial separation of two sets

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