Applicability of clipping of quadratic functional E = −0.5x + Tx + Bx in the minimization problem is considered (here x is the configurational vector and B ∈ R N is real valued vector). The probability that the gradient of this functional and the gradient of clipped functional ɛ = −0.5x + τx + bx are collinear is shown to be very high (the matrix τ is obtained by clipping of original matrix T: τij = sgnT ij ). It allows the conclusion that minimization of functional ɛ implies minimization of functional E. We can therefore replace the laborious process of minimizing functional E by the minimization of its clipped prototype ɛ. Use of the clipped functional allows sixteen-times reduction of the computation time and computer memory usage.