Abstract
AbstractIn a previous paper the authors have shown that the classical barrier function has anO(r) rate of convergence unless the problem is degenerate when it reducesO(r½). In this paper a modified barrier function algorithm is suggested which does not suffer from this problem. It turns out to have superior scaling properties which make it preferable to the classical algorithm, even in the nondegenerate case, if extrapolation is to be used to accelerate convergence.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
Paper Title
Journal
Date
