On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
SIAM Journal on Optimization
Interior point algorithm for P* nonlinear complementarity problems
Journal of Computational and Applied Mathematics
A Predictor-corrector algorithm with multiple corrections for convex quadratic programming
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
It is well known that the so-called first-order predictor-corrector methods working in a large neighborhood of the central path are among the most efficient interior-point methods (IPMs) for linear optimization (LO) problems. However, the best known iteration complexity of this type of method is $O(n \log\frac{(x^0)^Ts^0}{\varepsilon})$. It is of interest to investigate whether the complexity of first-order predictor-corrector type methods can be further improved. In this paper, based on a specific self-regular proximity function, we define a new large neighborhood of the central path. In particular, we show that the new neighborhood matches the standard large neighborhood that is defined by the infinity norm and widely used in the IPM literature. A new first-order predictor-corrector method for LO that uses a search direction induced by self-regularity in corrector steps is proposed. We prove that our predictor-corrector algorithm, working in a large neighborhood, has an $O(\sqrt{n}\log n \log\frac{(x^0)^Ts^0}{\varepsilon})$ iteration bound. Local superlinear convergence of the algorithm is also established.