On one general approach to the optimal correction of improper convex programming problems

A method of optimal correction of improper convex programming problems is suggested, which is based on using a Lagrange function regularized in both variables. This approach is independent of the kind of impropriety of the original problem. Conditions are formulated and estimates are established for the convergence of the method.