Description of the design space by extremal ellipsoids in data representation problems

Resumo

Problems of description of data sets by constructing the optimum ellipsoid are considered. The optimization problems are formulated as convex programming problems using linear matrix inequalities. The proposed methods are compared with similar methods designed earlier in accordance with two criteria: the volume of the ellipsoid and the number of points in the learning sample, which lie outside the ellipsoid.