Barrier function method and correction algorithms for improper convex programming problems

In the paper, convergence estimates are given for some generalization of the inverse barrier function method in convex programming. The significance of these estimates for constructing iterative algorithms is discussed. Regularizing properties of barrier functions and their application for optimal correction of improper convex programming problems are considered.