A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
From MaRDI portal
Publication:2114416
Abstract: For a linear complementarity problem, we present a relaxaiton accelerated two-sweep matrix splitting iteration method. The convergence analysis illustrates that the proposed method converges to the exact solution of the linear complementarity problem when the system matrix is an -matrix and the convergence conditions are given. Numerical experiments show that the proposed method is more efficient than the existing ones.
Recommendations
- A general relaxation two-sweep modulus-based matrix splitting iteration method for linear complementarity problems
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
Cites work
- \(H\)-splittings and two-stage iterative methods
- A modified modulus method for symmetric positive-definite linear complementarity problems.
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- A Relaxation Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- Convergence and comparison theorems for double splittings of matrices
- Convergence of relaxed parallel multisplitting methods
- Generalized AOR methods for linear complementarity problem
- scientific article; zbMATH DE number 3856287 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- Iterative algorithms for the linear complementarity problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems.
- Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Two-step modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
Cited in
(19)- Conjugate gradient method for the linear complementarity problem withs-matrix
- A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- Modulus-based circulant and skew-circulant splitting iteration method for the linear complementarity problem with a Toeplitz matrix
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- Interval relaxation method for linear complementarity problem
- scientific article; zbMATH DE number 177992 (Why is no real title available?)
- Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- A general relaxation two-sweep modulus-based matrix splitting iteration method for linear complementarity problems
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- On general fixed point method based on matrix splitting for solving linear complementarity problem
- A new matrix splitting generalized iteration method for linear complementarity problems
- Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP
- An inner-outer modulus-based method for solving horizontal linear complementarity problems
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- A modulus-based inner-outer iteration method for nonlinear complementarity problems
- Nonsmooth Newton methods for vertical linear complementarity problems
- A parallel iteration method based on two-stage multisplitting for solving horizontal linear complementarity problems
This page was built for publication: A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114416)
