On some universal methods of correction of the improper convex programming problems

Consideration was given to the methods of optimal correction of the improper problems of convex programming based on the Lagrange function regularized in both variables. The methods are independent of the kind of impropriety of the original problem. Approximation precision was estimated, and the relation of this approach to the existing methods of regularization of the incorrect extremal problems was discussed.