Convergence of SSOR methods for linear complementarity problems

DOI10.1016/j.orl.2009.01.013zbMath1167.90655OpenAlexW2052528714MaRDI QIDQ833585

Masoud Hajarian, Mehdi Dehghan

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.01.013

zbMATH Keywords

linear complementarity problem\(M\)-matrixiterative method\(H\)-matrixSSOR method

Mathematics Subject Classification ID

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

Related Items

Application of an improved \(\mathrm{P}(m)\)-SOR iteration method for flow in partially saturated soils, Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods, The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices, Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems, Modulus-based matrix splitting methods for complex linear complementarity problem, The new iteration methods for solving absolute value equations., The solution of a type of absolute value equations using two new matrix splitting iterative techniques, On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems, On generalizations of positive subdefinite matrices and the linear complementarity problem, PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX, A general preconditioner for linear complementarity problem with an \(M\)-matrix, Improving preconditioned SOR-type iterative methods for L-matrices, Two-step modulus-based matrix splitting iteration method for linear complementarity problems, Error bounds for linear complementarity problems of \(S\)-QN matrices, Fast modulus-based matrix splitting iteration methods for implicit complementarity problems, The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preconditioned AOR iterative method for linear systems
• Convergence of SSOR multisplitting method for an \(H\)-matrix
• A power penalty method for linear complementarity problems
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: The tridiagonal case
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Modified AOR methods for linear complementarity problem
• The linear complementarity problem as a separable bilinear program
• Improving projected successive overrelaxation method for linear complementarity problems
• Generalized AOR methods for linear complementarity problem
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Matrix multisplitting relaxation methods for linear complementarity problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Bimatrix Equilibrium Points and Mathematical Programming
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Complementarity problems