The $NP$-completeness of some problems of searching for vector subsets

We prove the $NP$-completeness of discrete optimization problems, to which some important problems appearing in data analysis involving a search for a vector subset are reduced.