Algorithms of quasidifferentiable optimization for the separation of point sets

DOI10.1007/978-0-387-89496-6_8MaRDI QIDQ3059287zbMATH OpenOpenAlexFDO

Authors B. Luderer, Denny Wagner

Publication date 8 December 2010

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-89496-6_8

zbMATH Keywords

Hausdorff distanceintersection of setsnumerical methodsquasidifferential calculusseparation of point sets

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Identification of point sets by quasidifferentiable functions
• Separation of two sets by piecewise linear function
• On the identification of points of two convex sets
• On the problem polyhedral separability: a numerical solution
• Set separation problems and global optimization.

Cited in

(4)

• Research on adjoint kernelled quasidifferential
• Randomized algorithms for the separation of point sets and for solving quadratic programs
• On the identification of points of two convex sets
• Identification of point sets by quasidifferentiable functions

This page was built for publication: Algorithms of quasidifferentiable optimization for the separation of point sets

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