Abstract
We applied the modified barrier function (MBF) method and its new extensions to the linear programming (LP) problem and compared with the known LP barrier method. We then extended to the MBF LP method the worst case estimate O( L√ m) for the computational cost of the solution of an LP problem (having input size L and the number of constraints and variables m) in terms of the number of Newton's steps (such an estimate is well-known for the LP barrier methods), and we showed the improved numerical stability of Newton's steps compared with the LP barrier methods.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
