Abstract
This paper aims to propose the new preconditioning approaches for solving linear complementarity problem (LCP). Some years ago, the preconditioned projected iterative methods were presented for the solution of the LCP, and the convergence of these methods has been analyzed. However, most of these methods are not correct, and this is because the complementarity condition of the preconditioned LCP is not always equivalent to that of the un-preconditioned original LCP. To overcome this shortcoming, we present a new strategy with a new preconditioner that ensures the solution of the same problem is correct. We also study the convergence properties of the new preconditioned iterative method for solving LCP. Finally, the new approach is illustrated with the help of a numerical example.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference33 articles.
1. Murty K.G., Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, Berlin (1988).
2. Bazaraa M.S., Sheral H.D. and Shetty C.M., Nonlinear Programming, Theory and Algorithms, 3rd edition. Wiley-Interscience, Hoboken, NJ (2006).
3. Cottle R.W., Pang J.S. and Stone R.E., The Linear Complementarity Problem. Academic Press, London (1992).
4. Matrix multisplitting relaxation methods for linear complementarity problems
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献