The use of a common Q-Féjèr's mapping instead of the projection operator in iterative methods for solving variational inequalities based on the iterative regularization principle that makes easier their application to mathematical programming problems is substantiated. The possibilities of using such iterative methods for concrete classes of problems (inparticular, of linear programming) are indicated.