文摘
The separation problem of two sets, whose convex hulls have a nonempty intersection, is considered. In order to find a solution of the problem algorithms of local and global search are developed. The efficiency of the algorithms is demonstrated by computational simulations on test examples.KeywordsSpherical separationD.C. functionNonsmooth optimizationLocal searchGlobal search