Abstract
Two interior-point algorithms using a wide neighborhood of the central path are proposed to solve nonlinear P*-complementarity problems. The proof of the polynomial complexity of the first method requires the problem to satisfy a scaled Lipschitz condition. When specialized to monotone complementarity problems, the results of the first method are similar to those in Ref. 1. The second method is quite different from the first in that the global convergence proof does not require the scaled Lipschitz assumption. However, at each step of this algorithm, one has to compute an approximate solution of a nonlinear system such that a certain accuracy requirement is satisfied.
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.
