About accuracy of the solution of internal subproblems in the Hestenes–Powell method

Constructive schemes of control of solution accuracy for internal optimization subproblems in the Hestenes–Powell method are suggested. The schemes can be applied to improper convex programming problems of the first kind. The optimum of the objective function on the set of minimizers of the quadratic penalty function is obtained.