On the weak convergence of the method of penalty functions with respect to argument (Q1975760)

In the method of penalty functions, the original extremum problem is approximated by a sequence of unconditional extremum problems. In this paper, the classes of problems in convex programming (these problems involve quasi-analytic functions) and classes of penalty functions are indicated for which the shortest distances between the optimal set of the original problem and the optimal sets of the corresponding approximating problems tend to zero with an infinitely increasing penalty coefficient.