A Non-interior Predictor-corrector Path-following Algorithm For NCP

The NCP(nonlinear complementarity problem) is considered a fundamental problem for optimization theory since the optimality condition of many continuous optimization problems can be formulated as an NCP , such as economic equilibrium models . the engineering sciences contact problem.In this paper we give a modified non-interior predictor-corrector path following algorithn for the NCP, and the global and local convergence analysis of the algorithm, at the end of this paper, there are numerical examples to show the efficacy of the algorithm.