Osborne, M. R. Dual barrier functions with superfast rates of convergence for the linear programming problem. (English) Zbl 0631.90036 J. Aust. Math. Soc., Ser. B 29, No. 1-2, 39-58 (1987). It is shown that barrier functions applied to the dual linear program can be modified to give multiplier estimates that converge to the solution of the primal problem. Newton’s method is considered for implementing this approach and numerical results presented. It has been shown that there is a connection between these methods and Karmarkar’s algorithm, but for the class of problems considered further improvements are still required before those methods become competitive with active set methods. MSC: 90C05 Linear programming 65K05 Numerical mathematical programming methods Keywords:barrier functions; dual linear program; multiplier estimates; Karmarkar’s algorithm PDFBibTeX XMLCite \textit{M. R. Osborne}, J. Aust. Math. Soc., Ser. B 29, No. 1--2, 39--58 (1987; Zbl 0631.90036) Full Text: DOI