Abstract
We modify the algorithm of Zhang to obtain anO(n2L) infeasible-interior-point algorithm for monotone linear complementarity problems that has an asymptoticQ-subquadratic convergence rate. The algorithm requires the solution of at most two linear systems with the same coefficient matrix at each iteration.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have