Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
The authors consider the following linear complementarity problem: \[ \text{Find a vector }x\in\mathbb{R}^n\text{ such that }Mx+ q\geq 0,\;x\geq 0, x^T(Mx+ q)= p,\tag{\(*\)} \] where \(M\) is a \((n,n)\)-matrix and \(q\in\mathbb{R}^n\). The generalized accelerated overrelaxation and the symmetric successive overrelaxation procedures are used to establish two synchronous matrix multisplitting methods to solve the problem \((*)\). Concepts of \(H\)-matrix and \(M\)-matrix are introduced and convergence results under the assumption that \(M\) is an \(H\)-matrix or an \(M\)-matrix, as well as conditions for the monotone convergence of the proposed methods are presented. Numerical results presented in the concluding part of the paper show that the proposed methods are effective for solving linear complementarity problems with large and sparse matrices. | |||
Property / review text: The authors consider the following linear complementarity problem: \[ \text{Find a vector }x\in\mathbb{R}^n\text{ such that }Mx+ q\geq 0,\;x\geq 0, x^T(Mx+ q)= p,\tag{\(*\)} \] where \(M\) is a \((n,n)\)-matrix and \(q\in\mathbb{R}^n\). The generalized accelerated overrelaxation and the symmetric successive overrelaxation procedures are used to establish two synchronous matrix multisplitting methods to solve the problem \((*)\). Concepts of \(H\)-matrix and \(M\)-matrix are introduced and convergence results under the assumption that \(M\) is an \(H\)-matrix or an \(M\)-matrix, as well as conditions for the monotone convergence of the proposed methods are presented. Numerical results presented in the concluding part of the paper show that the proposed methods are effective for solving linear complementarity problems with large and sparse matrices. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Karel Zimmermann / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C33 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5918662 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear complementarity problem | |||
Property / zbMATH Keywords: linear complementarity problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(M\)-matrix | |||
Property / zbMATH Keywords: \(M\)-matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(H\)-matrix | |||
Property / zbMATH Keywords: \(H\)-matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
SSOR method | |||
Property / zbMATH Keywords: SSOR method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
GAOR method | |||
Property / zbMATH Keywords: GAOR method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
monotone convergence | |||
Property / zbMATH Keywords: monotone convergence / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cam.2011.03.021 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2119593219 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4795617 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A modified damped Newton method for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modulus-based matrix splitting iteration methods for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the solution of large, structured linear complementarity problems: the block partitioned case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of general linear complementarity problems via nondifferentiable concave minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The linear complementarity problem as a separable bilinear program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of solutions to the complementarity problem and spanning properties of complementary cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3864313 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complementary pivot theory of mathematical programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3933378 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4003375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039868 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conjugate gradient method for the linear complementarity problem withs-matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A rapid algorithm for a class of linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer Solution for Linear Complementarity Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A power penalty method for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improving projected successive overrelaxation method for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modified AOR methods for linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized AOR methods for linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The convergence of parallel iteration algorithms for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inexact multisplitting methods for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A multisplitting method for symmetric linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2732180 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix multisplitting relaxation methods for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chaotic iterative methods for the linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of generalized multisplitting relaxation methods for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2780726 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4453963 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the convergence of the generalized AOR method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of SSOR multisplitting method for an \(H\)-matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preconditioned AOR iterative method for linear systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On convergence of two-stage splitting methods for linear complementarity problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:01, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems |
scientific article |
Statements
Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (English)
0 references
8 July 2011
0 references
The authors consider the following linear complementarity problem: \[ \text{Find a vector }x\in\mathbb{R}^n\text{ such that }Mx+ q\geq 0,\;x\geq 0, x^T(Mx+ q)= p,\tag{\(*\)} \] where \(M\) is a \((n,n)\)-matrix and \(q\in\mathbb{R}^n\). The generalized accelerated overrelaxation and the symmetric successive overrelaxation procedures are used to establish two synchronous matrix multisplitting methods to solve the problem \((*)\). Concepts of \(H\)-matrix and \(M\)-matrix are introduced and convergence results under the assumption that \(M\) is an \(H\)-matrix or an \(M\)-matrix, as well as conditions for the monotone convergence of the proposed methods are presented. Numerical results presented in the concluding part of the paper show that the proposed methods are effective for solving linear complementarity problems with large and sparse matrices.
0 references
linear complementarity problem
0 references
\(M\)-matrix
0 references
\(H\)-matrix
0 references
SSOR method
0 references
GAOR method
0 references
monotone convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references