This article is cited in 1 paper

The Problem of Spherical Binary Separability

T. V. Gruzdeva

Institute for System Dynamics and Control Theory SB of RAS, Lermontov Str., 134, Irkutsk, 664033, Russia

Abstract: The problem of separation of two sets, whose convex hulls have a nonempty intersection, is considered. Algorithms of local and global search are developed for this. The efficiency of the developed algorithms is demonstrated by computational simulations on test examples.

Keywords: nonsmooth problem; d.c. minimization; global optimality conditions; local search; global search algorithm.

UDC: 518.517