A modulus-based GSTS iteration method for linear complementarity problems

DOI10.4208/JMS.V48N1.15.01MaRDI QIDQ3195942zbMATH OpenOpenAlexFDO

Authors Minli Zeng, Guo-Feng Zhang

Publication date 28 October 2015

Published in Journal of Mathematical Study (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/jms.v48n1.15.01

zbMATH Keywords

convergencenumerical examplesiteration methodlinear complementarity problemsymmetric positive definite matrixJacobiGauss-Seidelskew-Hermitian triangular splitting iteration method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Modified modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
• On modulus-based matrix splitting iteration methods for linear complementarity problems
• Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems

Cited in

(3)

• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
• The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems
• The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone

This page was built for publication: A modulus-based GSTS iteration method for linear complementarity problems

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