Asynchronous multisplitting relaxation methods for linear complementarity problems

DOI10.1080/00207169908804772MaRDI QIDQ4243277zbMATH OpenOpenAlexFDO

Authors Zhong-Zhi Bai, D. J. Evans

Publication date 7 October 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804772

zbMATH Keywords

convergencelinear complementarity problemsparallel computing\(H\)-matrixAOR methodmatrix multisplittingaccelerated over-relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1874107
• scientific article; zbMATH DE number 2051935
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

Cites work

• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Chaotic relaxation
• Convergence of parallel multisplitting iterative methods for M-matrices
• Convergence of relaxed parallel multisplitting methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• Models of asynchronous parallel matrix multisplitting relaxed iterations
• Models of parallel chaotic iteration methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Parallel Numerical Solution of Variational Inequalities
• The convergence of parallel iteration algorithms for linear complementarity problems

Cited in

(18)

• Explicit synchronous partitioned algorithms for interface problems based on Lagrange multipliers
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• scientific article; zbMATH DE number 822132 (Why is no real title available?)
• The refined error bounds for linear complementarity problems of \(H_+\)-matrices
• Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
• Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
• scientific article; zbMATH DE number 1420728 (Why is no real title available?)
• Multisplitting and Schwarz methods for solving linear complementary problems
• Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
• MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum
• scientific article; zbMATH DE number 2051935 (Why is no real title available?)
• scientific article; zbMATH DE number 1874107 (Why is no real title available?)
• Relaxed asynchronous iterations for the linear complementarity problem
• The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems
• An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

This page was built for publication: Asynchronous multisplitting relaxation methods for linear complementarity problems

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