I. S. Litvinchev Comput. Math. Math. Phys. , vol.34 No.7 , 01.1994 , p. 843-847, language: английский  Аннотация An interior-point method for the convex minimization problem is proposed. On each iteration, an auxiliary relaxed problem of computing the lower bound of the optimum is solved. The rate of decrease of the difference between the current value of the objective function and the lower bound is investigated. The auxiliary relaxed problem is solved in the linear case.  Ключевые слова interior-point method, convex programming, lower bound of the optimum