We analyze a version of the Mizuno-Todd-Ye predictor-corrector interior point algorithm for the P_*(\kappa)-matrix linear complementarity problem (LCP). We assume the existence of a strictly positive feasible solution. Our version of the Mizuno-Todd-Ye predictor-corrector algorithm is a generalization of Potra’s (2002) conclusions on the LCP with P_*(\kappa)-matrices. To derive a formulation of the complexity for this algorithm we are using a |1/v – v| proximity measure like Potra. Our algorithm is different from Miao’s method (1995) in both the proximity measure used and the way of updating the centrality parameter. Our analysis is easier than the previosly stated results. We also show that the complexity of our algorithm is O((1+\kappa)^{3/2}\sqrt{n}L).
Citation
Operations Research Reports 04-01, Eötvös Loránd University, H-1117 Budapest, Pázmány Péter sétány 1/c