In the coordination problems for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph. The paper deals with the discrete consensus problem in the case where this condition is not satised. Let P be a row stochastic in uence matrix, whereas T_P is the subspace of initial opinions that ensure consensus in DeGroot's iterative pooling model. We propose a method of coordination that consists of: (1) transformation of the vector of initial opinions into the closest vector in T_P and (2) subsequent DeGroot process with the matrix P.