An algorithm for data analysis via polyhedral optimization

We propose the novel data analysis algorithm which allows to identify exactly the position of a given point as exterior, interior, or boundary relatively to an intersection of the finite number of pattern sets. Due to the special structure of the problem under study, this algorithm can be realized not only by sequential, but also by parallel computing on the basis of appropriate model decomposition.