Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems

DOI10.1016/j.cam.2016.02.011zbMath1334.90179OpenAlexW2278935847MaRDI QIDQ268353

Shi-Liang Wu, Cui-Xia Li

Publication date: 14 April 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.02.011

zbMATH Keywords

convergencelinear complementarity problemiteration methodmatrix splitting

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10) General methods in interval analysis (65G40)

Related Items (35)

An improved two-sweep iteration method for absolute value equations ⋮ A generalization of the AOR iteration method for solving absolute value equations ⋮ A smoothing Levenberg-Marquardt method for nonlinear complementarity problems ⋮ On the convergence of two-step modulus-based matrix splitting iteration method ⋮ A class of new modulus-based matrix splitting methods for linear complementarity problem ⋮ General fixed-point method for solving the linear complementarity problem ⋮ Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems ⋮ Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ AN IMPROVED BLOCK MODULUS METHOD FOR DIAGONALLY DOMINANT LINEAR COMPLEMENTARITY PROBLEMS ⋮ The reduced order method for solving the linear complementarity problem with an \(M\)-matrix ⋮ Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems ⋮ A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ Accelerated double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ An efficient modulus-based matrix splitting iteration method for quasi-complementarity problems ⋮ More on matrix splitting modulus-based iterative methods for solving linear complementarity problem ⋮ A class of modulus-based matrix splitting methods for vertical linear complementarity problem ⋮ The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ Modulus-based matrix splitting methods for complex linear complementarity problem ⋮ The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ Modulus-based matrix splitting iteration methods with new splitting scheme for horizontal implicit complementarity problems ⋮ Generalized SOR-like iteration method for linear complementarity problem ⋮ The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ THE RELAXATION TWO-SWEEP MODULUS-BASED MATRIX SPLITTING ITERATION METHODS FOR A CLASS OF NONLINEAR COMPLEMENTARITY PROBLEMS ⋮ Modified SOR-like method for absolute value equations ⋮ The modulus-based matrix double splitting iteration method for linear complementarity problems ⋮ Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems ⋮ Numerical efficiency of modified modulus-based multigrid cycles with application to free boundary problems ⋮ Newton-based matrix splitting method for generalized absolute value equation ⋮ Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ The relaxation convergence of multisplitting AOR method for linear complementarity problem ⋮ A class of two-step modulus-based matrix splitting iteration methods for quasi-complementarity problems ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ Fast modulus-based matrix splitting iteration methods for implicit complementarity problems ⋮ A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• A fixed point method for the linear complementarity problem arising from American option pricing
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• Convergence of relaxed parallel multisplitting methods
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• \(H\)-splittings and two-stage iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• On linear convergence of iterative methods for the variational inequality problem
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• Convergence and comparison theorems for double splittings of matrices
• Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix
• Complementary pivot theory of mathematical programming
• On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• Iterative algorithms for the linear complementarity problem
• Estimation of the Optimum Relaxation Factors in Partial Factorization Iterative Methods
• A Unified Representation and Theory of Algebraic Additive Schwarz and Multisplitting Methods
• Two-sweep iterative methods
• A Linear Complementarity Problem with a P-Matrix
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

This page was built for publication: Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems