The convergence of parallel iteration algorithms for linear complementarity problems

DOI10.1016/0898-1221(96)00172-1zbMath0873.65061MaRDI QIDQ1352387

Zhong Zhi Bai

Publication date: 30 October 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00172-1

zbMATH Keywords

convergence; numerical example; linear complementarity problem; \(H\)-matrix; multisplitting AOR methods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

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

Related Items

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems, Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem, Two-step modulus-based matrix splitting iteration method for linear complementarity problems, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, On convergence of two-stage splitting methods for linear complementarity problems, IGAOR and multisplitting IGAOR methods for linear complementarity problems, A modified damped Newton method for linear complementarity problems, Multisplitting iteration schemes for solving a class of nonlinear complementarity problems, MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems, Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems, A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices, The PMCGAOR and PMCSSOR methods for solving linear complementarity problems, Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix, Modulus-based matrix splitting iteration methods for linear complementarity problems, Asynchronous multisplitting relaxation methods for linear complementarity problems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• Convergence of relaxed parallel multisplitting methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Multisplittings and parallel iterative methods
• Complementary pivot theory of mathematical programming
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Parallel Numerical Solution of Variational Inequalities
• Bimatrix Equilibrium Points and Mathematical Programming
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation