No part of this Journal may be reproduced in any form, by print, photoprint, microolm or any other means without written permission from Abstract This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lip...

Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also p...

Extending our previous work Monteiro and Pang (1996), this paper studies properties of two fundamental mappings associated with the family of interior-point methods for solving monotone nonlinear complementarity problems over the cone of symmetric positive semideenite matrices. The rst of these maps lead to a family of new continuous trajectories which include the central trajectory as a specia...

In this article, we introduce the class of semimonotone star ($E_0^s$) matrices. We establish importance $E_0^s$-matrices in context complementarity theory. show that principal pivot transform $E_0^s$-matrix is not necessarily $E_0^s$ general. However, prove $\tilde{E_0^s}$-matrices, a subclass with some additional conditions, $E_0^f$ by showing $P_0.$ LCP$(q, A)$ can be processable Lemke's alg...

We revisit the class of column competent matrices and study some matrix theoretic properties this class. The local w-uniqueness solutions to linear complementarity problem can be identified by matrices. establish new results on in connection with These are significant context theory as well algorithms operations research. prove locally property Finally, we a between adequate help degree theory.

For getting the numerical solution of linear complementary problem (LCP), there are many methods such as modulus-based matrix splitting iteration and nonsmooth Newton?s method. We proposed Square-Newton method to solve LCP. This could LCP efficiently. gave theoretical analysis experiments in paper.