Abstract
The weighted Complementarity Problem (wCP) can be used for modelling a larger class of problems from science and engineering. In this paper, we first extend the solvability of the Complementarity Problems (CP) obtained by Yoshise [SIAM J. Optim. 17, 1129–1153 (2006)] to the wCP. Especially, we prove that the solution set of the wCP is bounded. We then propose a smoothing Newton algorithm to solve the wCP and prove that it is globally convergent. Moreover, we establish the local quadratic convergence of the proposed algorithm under the local error bound condition which is weaker than the nonsingularity condition used in previous smoothing Newton-type algorithms. Further, we apply the proposed algorithm to solve the weighted horizontal linear complementarity problem and report some numerical results.
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.
