On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
Authors:
- A. HadjidimosAHA. Hadjidimos
- M. LapidakisMLM. Lapidakis
- M. TzoumasMTM. Tzoumas
- 1 January 2012
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 33 (1) , 97-110
Abstract
The numerous applications of the linear complementarity problem (LCP) in, e.g., the solution of linear and convex quadratic programming, free boundary value problems of fluid mechanics, and moving boundary value problems of economics make its efficient numerical solution a very imperative and interesting area of research. For the solution of the LCP, many iterative methods have been proposed, especially, when the matrix of the problem is a real positive definite or an $H_{+}$-matrix. In this work we assume that the real matrix of the LCP is an $H_{+}$-matrix and solve it by using a new method, the scaled extrapolated block modulus algorithm, as well as an improved version of the very recently introduced modulus-based matrix splitting modified AOR iteration method. As is shown by numerical examples, the two new methods are very effective and competitive with each other. (A corrected PDF is attached to this article.)Keywords
This publication has 24 references indexed in Scilit:
- Modulus-based matrix splitting iteration methods for linear complementarity problemsNumerical Linear Algebra with Applications, 2010
- A new iterative criterion for H-matrices: The reducible caseLinear Algebra and its Applications, 2008
- A New Iterative Criterion for H‐MatricesSIAM Journal on Matrix Analysis and Applications, 2007
- How to improve MAOR method convergence area for linear complementarity problemsApplied Mathematics and Computation, 2005
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous MethodsInternational Journal of Computer Mathematics, 2002
- On the Convergence of the Multisplitting Methods for the Linear Complementarity ProblemSIAM Journal on Matrix Analysis and Applications, 1999
- Matrix multisplitting relaxation methods for linear complementarity problemsInternational Journal of Computer Mathematics, 1997
- The convergence of parallel iteration algorithms for linear complementarity problemsComputers & Mathematics with Applications, 1996
- Solution of nonsymmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1981
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971