An improved predictor-corrector interior-point algorithm for linear complementarity problems with O(√nL)-iteration complexity

This paper proposes an improved predictor-corrector interior-point algorithm for the linear complementarity problem (lcp) based on the mizuno-todd-ye algorithm. the modified corrector steps in our algorithm cannot only draw the iteration point back to a narrower neighborhood of the center path but also reduce the duality gap. it implies that the improved algorithm can converge faster than the mty algorithm. the iteration complexity of the improved algorithm is proved to obtain o(√nl) which is similar to the classical mizuno-todd-ye algorithm. finally,the numerical experiments show that our algorithm improved the performance of the classical mty algorithm. copyright © 2011 debin fang and qian yu.