Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Paper Title
Journal
Date
