The convergence of parallel iteration algorithms for linear complementarity problems

DOI10.1016/0898-1221(96)00172-1zbMath0873.65061OpenAlexW2052028268MaRDI 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

convergencenumerical examplelinear complementarity problem\(H\)-matrixmultisplitting AOR methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems ⋮ The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems ⋮ On the convergence of two-step modulus-based matrix splitting iteration method ⋮ A modified damped Newton method for linear complementarity problems ⋮ An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems ⋮ The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method ⋮ A variant of two-step modulus-based matrix splitting iteration method for retinex problem ⋮ Multisplitting iteration schemes for solving a class of nonlinear complementarity problems ⋮ Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem ⋮ The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices ⋮ Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems ⋮ The nonsmooth Newton's method for the horizontal nonlinear complementarity problem ⋮ A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems ⋮ IGAOR and multisplitting IGAOR methods for linear complementarity problems ⋮ Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem ⋮ New convergence of modulus-based synchronous block multisplitting multi-parameter methods for linear complementarity problems ⋮ A modulus-based multigrid method for image retinex ⋮ Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems ⋮ Two-step modulus-based matrix splitting iteration method for linear complementarity problems ⋮ The modulus-based matrix double 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 ⋮ MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems ⋮ Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems ⋮ Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix ⋮ Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems ⋮ A note on the MSMAOR method for linear complementarity problems ⋮ Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems ⋮ Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ GLOBAL RELAXED MODULUS-BASED SYNCHRONOUS BLOCK MULTISPLITTING MULTI-PARAMETERS METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS ⋮ The improved convergence of MSMMAOR method for linear complementarity problems ⋮ The relaxation convergence of multisplitting AOR method for linear complementarity problem ⋮ Modulus-based matrix splitting iteration methods for linear complementarity problems ⋮ The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ A preconditioned multisplitting and Schwarz method for linear complementarity problem ⋮ A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices ⋮ The PMCGAOR and PMCSSOR methods for solving 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