Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
DOI10.1002/nla.1835zbMath1313.65131OpenAlexW1956819437MaRDI QIDQ2931515
Publication date: 25 November 2014
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1835
convergencelinear complementarity problemparallel computationsuccessive overrelaxationaccelerated overrelaxationmatrix multisplittingsuccessive relaxationmodulus methodnumerical resultscomputational efficiency
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Related Items (only showing first 100 items - show all)
Cites Work
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- On the convergence of the parallel multisplitting AOR algorithm
- The principle of extrapolation and the Cayley transform
- Conjugate gradient method for the linear complementarity problem withs-matrix
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- Convergence of relaxed parallel multisplitting methods
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- \(H\)-splittings and two-stage iterative methods
- A multisplitting method for symmetric linear complementarity problems
- Flexible Conjugate Gradients
- A modified modulus method for symmetric positive-definite linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Accelerated Overrelaxation Method
- Matrix multisplitting relaxation methods for linear complementarity problems
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A generalization of the linear complementarity problem
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Matrix Iterative Analysis
- Unnamed Item
- Unnamed Item
This page was built for publication: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems