# The Complexity of High-Order Interior-Point Methods for Solving Sufficient Complementarity Problems

## Abstract

Recently the authors of this paper and S. Mizuno described a class of infeasible-interior-point methods for solving linear complementarity problems that are sufficient in the sense of Cottle, Pang and Venkateswaran [1]. It was shown that these methods converge superlinearly with an arbitrarily high order even for degenerate problems or problems without strictly complementary solution. In this paper we report on some recent results on the complexity of these methods. We outline a proof that these methods need at most \(\mathcal{O}\left( {(1 + \kappa )\sqrt {n|\log \varepsilon |} } \right)\) steps to compute an *ε*-solution, if the problem has strictly interior points. Here, *к* is the sufficiency parameter of the complementarity problem.

## Keywords

Complementarity Problem Linear Complementarity Problem Feasible Point Interior Point Method Interior Point Algorithm## Preview

Unable to display preview. Download preview PDF.

## References

- 1.R.W. Cottle, J.-S. Pang, V. Venkateswaran (1989) Sufficient matrices and the linear complementarity problem,
*Linear Algebra Appl*.**114/115**, 231–249.CrossRefGoogle Scholar - 2.J. Ji, F.A. Potra, R. Sheng (1994) A predictor-corrector method for solving the
*P*_{*}-matrix LCP from infeasible starting points. Report of Computational Mathematics 55, Department of Mathematics, The University of Iowa, Iowa, IA.Google Scholar - 3.M. Kojima, N. Megiddo, S. Mizuno (1991) A primal-dual exterior point algorithm for linear programming. Research Report RJ 8500, IBM Almaden Research Center, San José, CA.Google Scholar
- 4.M. Kojima, N. Megiddo, T. Noma, A. Yoshise (1991)
*A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems*, Lecture Notes in Computer Science, Vol.**538**, Springer-Verlag, Berlin.CrossRefGoogle Scholar - 5.S. Mizuno, F. Jarre, J. Stoer (1996) A unified approach to infeasible-interiorpoint algorithms via geometrical linear complementarity problems,
*J. Appl. Math. Optim*.**13**, 315–341.CrossRefGoogle Scholar - 6.J. Stoer, M. Wechs (1998) Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity.
*Math. Programming*.**83**, 407–423.Google Scholar - 7.J. Stoer, M. Wechs (1998) The Complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems.
*Optimization Methods and Software***10**393–417.CrossRefGoogle Scholar - 8.J. Stoer, M. Wechs, S. Mizuno (1998) High order infeasible-interior-point methods for solving sufficient linear complementarity problems.
*Math. of Oper. Res.***23**, 832–862.CrossRefGoogle Scholar - 9.J. Sturm (1996) Superlinear convergence of an algorithm for monotone linear coтplementarity problems, when no strictly complementary solution exists. Report 9656/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.Google Scholar
- 10.H. Väliaho (1996)
*P*_{*}-matrices are just sufficient,*Linear Algebra Appl*.**239**, 103–108.Google Scholar - 11.G. Zhao (1996) On the relationship between the curvature integral and the complexity of path-following methods in linear programming,
*SIAM J. Optimization***6**, 57–73.CrossRefGoogle Scholar - 12.G. Zhao, J. Zhu (1995) The curvature integral and the complexity of linear complementarity problems,
*Math. Programming***70**, 107–122.CrossRefGoogle Scholar - 13.G. Zhao (1998) Interior point algorithms for linear complementarity problems based on large neighbourhoods of the central path. To appear in
*SIAM J. Optimization*.Google Scholar