In this paper, we propose a new predictor---corrector interior-point algorithm for linear programming based on a wide neighbourhood. In each iteration, the algorithm computes the Ai-Zhang's predictor direction (SIAM J. Optim. 16(2):400---417, 2005) and a new corrector direction, in an attempt to improve its performance. We drive that the duality gap reduces in both predictor and corrector steps. Moreover, we also prove that the complexity of the algorithm coincides with the best iteration bound for small neighbourhood algorithms. Finally, some numerical experiments are provided which reveal capability and effectiveness of the proposed method.
Read full abstract