Abstract
We adopt the self-adaptive strategy to update the barrier parameter of a feasible primal-dual interior-point algorithm. We obtain two adaptive updating methods, namely, cheap updates and sharp updates. We compare the effectiveness of the short updates with the adaptive update methods on some benchmark problems. The numerical results show that the sharp updates method is superior to short updates and cheap updates 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.
