The method of penalty functions and regularization in the analysis of improper convex programming problems

We consider the questions of correction of improper convex programming problems, first of all, problems with inconsistent systems of constraints. Such problems often arise in the practice of mathematical simulation of specific applied settings in operations research. Since improper problems are rather frequent, it is important to develop methods of their correction, i.e., methods of construction of solvable models that are close to the original problems in a certain sense. Solutions of these models are taken as generalized (approximation) solutions of the original problems. We construct the correcting problems using a variation of the right-hand sides of the constraints with respect to the minimum of a certain penalty function, which, in particular, can be taken as some norm of the vector of constraints. As a result, we obtain optimal correction methods that are modifications of the (Tikhonov) regularized method of penalty functions. Special attention is paid to the application of the exact penalty method. Convergence conditions are formulated for the proposed methods and convergence rates are established.