Abstract
In this paper, we present a nonmonotone smoothing Newton type algorithm for solving the horizontal linear complementarity problem. We show that the proposed algorithm is globally convergent under an assumption that has the column -property. Such an assumption is weaker than those required by most other smoothing Newton algorithms. The preliminary numerical results are reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have