Abstract
A higher order corrector-predictor interior-point method is proposed for solving sufficient linear complementarity problems. The algorithm produces a sequence of iterates in the $\caln_{\infty}^{-}$ neighborhood of the central path. The algorithm does not depend on the handicap k of the problem. It has $O((1+\kappa)\sqrt{n}L)$ iteration complexity and is superlinearly convergent even for degenerate problems.
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.
