On the choice of parameters in MAOR type splitting methods for the linear complementarity problem (Q478194): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-014-9824-1 / rank
Normal rank
 
Property / author
 
Property / author: Ljiljana Cvetković / rank
Normal rank
 
Property / author
 
Property / author: Apostolos Hadjidimos / rank
Normal rank
 
Property / author
 
Property / author: Vladimir R. Kostić / rank
Normal rank
 
Property / review text
 
The paper considers the solution of the linear complementarity problem with an \(H_{+}\) coefficient matrix by the modified accelerated overrelaxation (MAOR) iterative methods. The best positive diagonal matrix-parameter involved in the modified accelerated overrelaxation iterative method is determined. The smallest upper bound for the spectral radius of the nonnegative iteration matrix of the proposed modified accelerated overrelaxation iterative methods is found to be the modified Gauss-Seidel method.
Property / review text: The paper considers the solution of the linear complementarity problem with an \(H_{+}\) coefficient matrix by the modified accelerated overrelaxation (MAOR) iterative methods. The best positive diagonal matrix-parameter involved in the modified accelerated overrelaxation iterative method is determined. The smallest upper bound for the spectral radius of the nonnegative iteration matrix of the proposed modified accelerated overrelaxation iterative methods is found to be the modified Gauss-Seidel method. / 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: 65F10 / 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: 6376433 / rank
 
Normal rank
Property / zbMATH Keywords
 
linear complementarity problem
Property / zbMATH Keywords: linear complementarity problem / rank
 
Normal rank
Property / zbMATH Keywords
 
\(M\)-matrices
Property / zbMATH Keywords: \(M\)-matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
\(H_{+}\)-matrices
Property / zbMATH Keywords: \(H_{+}\)-matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
modulus-based splitting iterative methods
Property / zbMATH Keywords: modulus-based splitting iterative methods / rank
 
Normal rank
Property / zbMATH Keywords
 
multisplitting methods
Property / zbMATH Keywords: multisplitting methods / rank
 
Normal rank
Property / zbMATH Keywords
 
modified accelerated overrelaxation iterative method
Property / zbMATH Keywords: modified accelerated overrelaxation iterative method / rank
 
Normal rank
Property / zbMATH Keywords
 
Gauss-Seidel method
Property / zbMATH Keywords: Gauss-Seidel method / rank
 
Normal rank
Property / author
 
Property / author: Ljiljana Cvetković / rank
 
Normal rank
Property / author
 
Property / author: Apostolos Hadjidimos / rank
 
Normal rank
Property / author
 
Property / author: Vladimir R. Kostić / 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.1007/s11075-014-9824-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053031870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods / 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: Modulus-based matrix splitting iteration 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: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / 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: A note on the convergence of the MSMAOR method for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified modulus method for symmetric positive-definite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-splittings and two-stage iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive overrelaxation (SOR) and related methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for the linear complementarity problem / 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: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for weak splittings of bounded operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems on M-splittings of a singular M-Matrix which depend on graph structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent nonnegative matrices and iterative methods for consistent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Equations in Several Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative splitting theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-step modulus-based matrix splitting iteration method for linear complementarity problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-014-9824-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 9 December 2024

scientific article
Language Label Description Also known as
English
On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
scientific article

    Statements

    On the choice of parameters in MAOR type splitting methods for the linear complementarity problem (English)
    0 references
    3 December 2014
    0 references
    The paper considers the solution of the linear complementarity problem with an \(H_{+}\) coefficient matrix by the modified accelerated overrelaxation (MAOR) iterative methods. The best positive diagonal matrix-parameter involved in the modified accelerated overrelaxation iterative method is determined. The smallest upper bound for the spectral radius of the nonnegative iteration matrix of the proposed modified accelerated overrelaxation iterative methods is found to be the modified Gauss-Seidel method.
    0 references
    linear complementarity problem
    0 references
    \(M\)-matrices
    0 references
    \(H_{+}\)-matrices
    0 references
    modulus-based splitting iterative methods
    0 references
    multisplitting methods
    0 references
    modified accelerated overrelaxation iterative method
    0 references
    Gauss-Seidel method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers