Abstract.
In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This framework is applied to the PATH solver in order to show viability of the approach. Numerical results for an appropriate modification of the PATH solver indicate that this framework leads to substantial computational improvements.
Access this article
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 9, 1998 / Revised version received November 23, 1998¶Published online March 16, 1999
Rights and permissions
About this article
Cite this article
Ferris, M., Kanzow, C. & Munson, T. Feasible descent algorithms for mixed complementarity problems. Math. Program. 86, 475–497 (1999). https://doi.org/10.1007/s101070050101
Issue Date:
DOI: https://doi.org/10.1007/s101070050101