Q-superlinear convergence of the iterates in primal–dual interior-point methods

Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by primal–dual interior-point methods for linear complementarity problems. It is shown that those conditions are satisfied by several well known interior-point methods. In particular it is shown that the iteration sequences produced by the simplified predictor–corrector method of Gonzaga and Tapia, the simplified largest step method of Gonzaga and Bonnans, the LPF+ algorithm of Wright, the higher order methods of Wright and Zhang, Potra and Sheng, and Stoer et al. are Q-superlinearly convergent.