Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
From MaRDI portal
Publication:550095
DOI10.1016/j.cam.2011.03.021zbMath1220.65066OpenAlexW2119593219MaRDI QIDQ550095
Masoud Hajarian, Mehdi Dehghan
Publication date: 8 July 2011
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.2011.03.021
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix, Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems, Momentum acceleration-based matrix splitting method for solving generalized absolute value equation, Modulus-based matrix splitting methods for complex linear complementarity problem, On generalizations of positive subdefinite matrices and the linear complementarity problem, Linearized methods for tensor complementarity problems, 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On convergence of two-stage splitting methods for linear complementarity problems
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- A modified damped Newton method for linear complementarity problems
- Preconditioned AOR iterative method for linear systems
- Convergence of SSOR multisplitting method for an \(H\)-matrix
- A power penalty method for linear complementarity problems
- Conjugate gradient method for the linear complementarity problem withs-matrix
- A class of generalized multisplitting relaxation methods for linear complementarity problems
- 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
- Chaotic iterative methods for the linear complementarity problems
- The convergence of parallel iteration algorithms for linear complementarity problems
- On the convergence of the generalized AOR method
- 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
- A multisplitting method for symmetric linear complementarity problems
- Generalized AOR methods for linear complementarity problem
- A rapid algorithm for a class of linear complementarity problems
- Inexact multisplitting methods for linear complementarity problems
- Complementary pivot theory of mathematical programming
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Integer Solution for Linear Complementarity Problem
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- Bimatrix Equilibrium Points and Mathematical Programming
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
