A new efficient large-update primal-dual interior-point method based on a finite barrier. (English summary) SIAM J. Optim. 13 (2002), no. 3, 766–782 (electronic) (2003). It is well known that interior-point methods (IPMs) are closely associated with various barrier functions for the constraint cone. In this paper, the authors consider a specific function that does not have the usual barrier properties of common functions in the literature, and use it to compute search directions and keep control on the update of the iterate. It is proved that the complexity of the proposed IPM with large-updates matches the best known complexity results for large-update IPMs
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.