Abstract
In this paper an interior-point algorithm for P *(?) horizontal linear complementarity problems is proposed that uses new search directions. The theoretical complexity of the new algorithm is calculated. It is investigated that the proposed algorithm has quadratically convergent with polynomial iteration complexity $O((1+\kappa)\sqrt{n}\log\frac{n}{\varepsilon})$ , coincide with the best known iteration bound for P *(?) horizontal linear complementarity problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
