@Article{JCM-22-3,
author = {},
title = {A Truly Globally Convergent Feasible Newton-Type Method for Mixed Complementarity Problems},
journal = {Journal of Computational Mathematics},
year = {2004},
volume = {22},
number = {3},
pages = {347--360},
abstract = {<p style="text-align: justify;">Typical solution methods for solving mixed complementarity problems either generate feasible iterates but have to solve relatively complicated subproblems such as quadratic programs or linear complementarity problems, or (those methods) have relatively simple subproblems such as system of linear equations but possibly generate infeasible iterates. In this paper, we propose a new Newton-type method for solving monotone mixed complementarity problems, which ensures to generate feasible iterates, and only has to solve a system of well-conditioned linear equations with reduced dimension per iteration. Without any regularity assumption, we prove that the whole sequence of iterates converges to a solution of the problem (truly globally convergent). Furthermore, under suitable conditions, the local superlinear rate of convergence is also established.</p>},
issn = {1991-7139},
doi = {https://doi.org/2004-JCM-8855},
url = {https://global-sci.com/article/85224/a-truly-globally-convergent-feasible-newton-type-method-for-mixed-complementarity-problems}
}