Квадратичные задачи компьютерной геометрии

Paper is devoted to the statement and the solution of a class of quadratic optimizing problems in the computer geometry: the search of ellipsoid the minimum volume that contain the set of points of Euclidean space, the search of the minimum distance between ellipsoids, the construction of the hyperplane separating two ellipsoids. Effective algorithms for the solution of this class of problems are offered.