An improved block modulus method for diagonally dominant linear complementarity problems

DOI10.12286/JSSX.J2021-0774MaRDI QIDQ5868478zbMATH OpenOpenAlexFDO

Authors Zhang Lili

Publication date 20 September 2022

Full work available at URL http://www.computmath.com/jssx/EN/10.12286/jssx.j2021-0774

zbMATH Keywords

block modulus methodconvergencediagonally dominant matrixlinear complementarity problem

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• A non-modulus linear method for solving the linear complementarity problem
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• Modified modulus-based matrix splitting iteration methods for linear complementarity problems.
• A modified general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• A modified general modulus-based matrix splitting method for linear complementarity problems of \({H_+}\)-matrices

Cites work

• \(H\)-splittings and two-stage iterative methods
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• A modified general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• A modulus iteration method for retinex problem
• A New Iterative Criterion for H‐Matrices
• A preconditioned modulus-based iteration method for solving linear complementarity problems of H-matrices
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
• Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H_+-matrix
• Convergence of relaxed parallel multisplitting methods
• Engineering and Economic Applications of Complementarity Problems
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 1433445 (Why is no real title available?)
• Iterative algorithms for the linear complementarity problem
• Modified Newton-type iteration methods for generalized absolute value equations
• Modulus methods for nonnegatively constrained image restoration
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based multigrid methods for linear complementarity problems.
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• On iterative solution for linear complementarity problem with an \(H_{+}\)-matrix
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Schur complements of diagonally dominant matrices
• Sufficient matrices and the linear complementarity problem
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems

Cited in

(3)

• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

This page was built for publication: An improved block modulus method for diagonally dominant linear complementarity problems

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