Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

DOI10.1080/00207160211927zbMath1011.65033MaRDI QIDQ4780533

David J. Evans, Zhong Zhi Bai

Publication date: 6 February 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160211927

zbMATH Keywords

linear complementarity problem; parallel computation; relaxation technique; convergence theory; matrix multisplitting; asynchronous iterative methods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C20: Quadratic programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

65Y05: Parallel numerical computation

Related Items

Asynchronous iterations with flexible communication: contracting operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• Models of asynchronous parallel matrix multisplitting relaxed iterations
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Models of parallel chaotic iteration methods
• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• On the convergence of a basic iterative method for the implicit complementarity problem
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Asynchronous multisplitting two-stage iterations for systems of weakly nonlinear equations
• Chaotic iterative methods for the linear complementarity problems
• The convergence of parallel iteration algorithms for linear complementarity problems
• A class of two-stage iterative methods for systems of weakly nonlinear equations
• Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• Matrix norm versions of the Kantorovich inequality and its applications
• A multisplitting method for symmetric linear complementarity problems
• On the convergence of iterative methods for symmetric linear complementarity problems
• Complementary pivot theory of mathematical programming
• On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Asynchronous multisplitting relaxation methods for linear complementarity problems
• Parallel Numerical Solution of Variational Inequalities
• Matrix multisplitting relaxation methods for linear complementarity problems
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS