A PENALTY TECHNIQUE FOR NONLINEAR COMPLEMENTARITY PROBLEMS ∗1
Donghui Li, Jinping Zeng
Abstract
Donghui Li, Jinping Zeng
Abstract
In this paper, we first give a new equivalent optimization form to nonlinear complementarity problems and then establish a damped Newton method in which penalty technique is used. The subproblems of the method are lower-dimensional linear complementarity problems. We prove that the algorithm converges globally for strongly monotone complementarity problems. Under certain conditions, the method possesses quadratic convergence. Few numerical results are also reported.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we first give a new equivalent optimization form to nonlinear complementarity problems and then establish a damped Newton method in which penalty technique is used. The subproblems of the method are lower-dimensional linear complementarity problems. We prove that the algorithm converges globally for strongly monotone complementarity problems. Under certain conditions, the method possesses quadratic convergence. Few numerical results are also reported.
Key concepts: Nonlinear complementarity problem, Mixed complementarity problem, Complementarity theory, Complementarity (molecular biology), Mathematics, Monotone polygon, Mathematical optimization, Quadratic equation