Improved convergence theorems of multisplitting methods for the linear complementarity problem

DOI10.1016/J.AMC.2014.06.038MaRDI QIDQ280082zbMATH OpenOpenAlexFDO

Authors Litao Zhang, Xianyu Zuo, Tongxiang Gu, Xing-Ping Liu

Publication date 29 April 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2014.06.038

zbMATH Keywords

convergencelinear complementarity problem\(M\)-matrix

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems
• Convergence of modulus-based multisplitting iteration methods for linear complementarity problems with \(M\)-matrices
• scientific article; zbMATH DE number 151767
• Inexact multisplitting methods for linear complementarity problems
• New convergence proofs of modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• On convergence of two-stage splitting methods for linear complementarity problems
• Multisplitting iteration schemes for solving a class of nonlinear complementarity problems

Cites work

• scientific article; zbMATH DE number 30397 (Why is no real title available?)
• scientific article; zbMATH DE number 1323080 (Why is no real title available?)
• A multisplitting method for symmetric linear complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Convergence of relaxed parallel multisplitting methods
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• On the convergence of iterative methods for symmetric linear complementarity problems
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Solution of symmetric linear complementarity problems by iterative methods
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems
• Topological proofs for certain theorems on matrices with non-negative elements
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems

Cited in

(16)

• A multisplitting method for symmetrical affine second-order cone complementarity problem
• Inexact multisplitting methods for linear complementarity problems
• Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem
• A accelerated modified shift-splitting method for nonsymmetric saddle point problems
• The relaxation convergence of multisplitting AOR method for linear complementarity problem
• Convergence of relaxed matrix parallel multisplitting chaotic methods for \(H\)-matrices
• Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems
• Global relaxed modulus-based synchronous block multisplitting multi-parameters methods for linear complementarity problems
• A multiplicative multisplitting method for solving the linear complementarity problem
• The improved convergence of MSMMAOR method for linear complementarity problems
• Relaxed modulus-based synchronous multisplitting multi-parameters TOR (two-parameters over-relaxation) methods for linear complementarity problems
• New convergence of modulus-based synchronous block multisplitting multi-parameter methods for linear complementarity problems
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• How to improve MAOR method convergence area for linear complementarity problems

This page was built for publication: Improved convergence theorems of multisplitting methods for the linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280082)