Abstract
In this work, null space techniques are employed to tackle nonlinear complementarity problems (NCPs). NCP conditions are transform into a nonlinear programming problem, which is handled by null space algorithms. The NCP conditions are divided into two groups. Some equalities and inequalities in an NCP are treated as constraints. While other equalities and inequalities in an NCP are to be regarded as objective function. Two groups are all updated in every step. Null space approaches are extended to nonlinear complementarity problems. Two different solvers are employed for an NCP in an algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No.10501019) and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.
Rights and permissions
About this article
Cite this article
Nie, Py. A Null Space Approach for Solving Nonlinear Complementarity Problems. Acta Mathematicae Applicatae Sinica, English Series 22, 9–20 (2006). https://doi.org/10.1007/s10255-005-0279-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10255-005-0279-y