Affiliation:
1. School of Mathematics and Computer Sciences, Nanchang University
Abstract
For getting the numerical solution of the linear complementary problem (LCP),
there are many methods such as the modulus-based matrix splitting iteration
and the modulus-based nonsmooth Newton?s method. We proposed the
Square-Newton method to solve the LCP. This method could solve LCP
efficiently. We gave the theoretical analysis and numerical experiments in
the paper.
Publisher
National Library of Serbia
Reference25 articles.
1. Cottle, Richard W and Dantzig, George B, Complementary pivot theory of mathematical programming, Linear Algebra and Its Applications 1 (1968) 103-125.
2. Pardalos, Panos M, The Linear Complementarity Problem, Advances in Optimization and Numerical Analysis 7 (1994) 39-49.
3. Sch¨afer, Uwe, A Linear Complementarity Problem with a P-Matrix, Siam Review 46 (2004) 189-201.
4. Cryer, Colin W, The solution of a quadratic programming using systematic overrelaxation, SIAM Journal on Control 9 (1971) 385-392.
5. Bai, Zhong Zhi, On the monotone convergence of the projected iteration methods for linear complementarity problem, Numerical Mathematics A Journal of Chinese Universities 5 (1996) 228-233.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献