Abstract
In this paper, we propose a non-interior continuation algorithm for solving the P 0 -matrix linear complementarity problem (LCP), which is conceptually simpler than most existing non-interior continuation algorithms in the sense that the proposed algorithm only needs to solve at most one linear system of equations at each iteration. We show that the proposed algorithm is globally convergent under a common assumption. In particular, we show that the proposed algorithm is globally linearly and locally quadratically convergent under some assumptions which are weaker than those required in many existing non-interior continuation algorithms. It should be pointed out that the assumptions used in our analysis of both global linear and local quadratic convergence do not imply the uniqueness of the solution to the LCP concerned. To the best of our knowledge, such a convergence result has not been reported in the literature.
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.
