Abstract
Based on the concept of the regularized central path, a new non--interior-point path-following algorithm is proposed for solving the P0 linear complementarity problem (P0 LCP). The condition ensuring the global convergence of the algorithm for P0 LCPs is weaker than most conditions previously used in the literature. This condition can be satisfied even when the strict feasibility condition, which has often been assumed in most existing non--interior-point algorithms, fails to hold. When the algorithm is applied to P* and monotone LCPs, the global convergence of this method requires no assumption other than the solvability of the problem. The local superlinear convergence of the algorithm can be achieved under a nondegeneracy assumption. The effectiveness of the algorithm is demonstrated by our numerical experiments.
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.
