Linear Classifier and Projection Onto a Polytope

An algorithm for constructing binary linear classifiers is considered. Objects of recognition are presented by points of an n-dimensional Euclidean space. The algorithm is based on solving the problem of projecting zero onto the convex hull of a finite number of points of Euclidean space.