Combining existing approaches, we provide a uniform way to describe all hyperplanes which separate (properly, or strong\-ly) a given pair of non\-emp\-ty convex sets K1K_1 and K2K_2 in the nn-dimensional Euclidean space. The method is based on considering (n ⁣ ⁣1)(n\! -\! 1)-dimensional subspaces which bound the set K1 ⁣ ⁣K2K_1 \!-\! K_2 and then using properties of the polar cone (K1 ⁣ ⁣K2)(K_1 \!-\! K_2)^\circ. First, we characterize all separating hyperplanes with given normal vectors, and then those containing a given point. We also describe the union of all hyperplanes separating (properly separating) a given pair of convex sets.

Contact details are reproduced from the original publication and may be historical.

Valeriu Soltan

Dept. of Mathematical Sciences, George Mason University, Fairfax, VA 22030, U.S.A.

vsoltan@gmu.edu

V. Soltan. “Separating Hyperplanes of Convex Sets.” Journal of Convex Analysis 28 (2021), No. 4, 1015–1032.