A New Prodictor-Corrector Path Following Method for Linear Programming
Huang Zhenghai Wang Xianjie
Based on wide-neighbourhood , we in this paper produce a prodictor-corrector algorithm for linear programming, which possesse one predictor step and two corrector steps. Its iteration complixity bound is O(n~(2/3) L).Our algorithm improve on the iteration complexity of O(n~(3/4) L) of the predictor-corrector algorithm proposed by Y.Zhang and D.Zhang.
【CateGory Index】： O411