The convergence of parallel iteration algorithms for linear complementarity problems

DOI10.1016/0898-1221(96)00172-1MaRDI QIDQ1352387zbMATH OpenOpenAlexFDO

Authors Zhong-Zhi Bai

Publication date 30 October 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(96)00172-1

zbMATH Keywords

\(H\)-matrixconvergencelinear complementarity problemmultisplitting AOR methodsnumerical example

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) 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
• Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
• A parallel alternating iterative algorithm for linear complementarity problems
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

Cites work

• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Convergence of relaxed parallel multisplitting methods
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3919744 (Why is no real title available?)
• scientific article; zbMATH DE number 3747703 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Multisplittings and parallel iterative methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Parallel Numerical Solution of Variational Inequalities
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

Cited in

(50)

• An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
• The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
• A modulus-based multigrid method for image retinex
• The modulus-based matrix double splitting iteration method for linear complementarity problems
• MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems
• Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems
• On the convergence of two-step modulus-based matrix splitting iteration method
• A variant of two-step modulus-based matrix splitting iteration method for retinex problem
• Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
• A preconditioned multisplitting and Schwarz method for linear complementarity problem
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems
• The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems
• Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H_+-matrix
• The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices
• A note on the MSMAOR method for linear complementarity problems
• The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
• A parallel alternating iterative algorithm for linear complementarity problems
• Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• Asynchronous multisplitting relaxation methods for linear complementarity problems
• scientific article; zbMATH DE number 2013209 (Why is no real title available?)
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• scientific article; zbMATH DE number 871908 (Why is no real title available?)
• Global relaxed modulus-based synchronous block multisplitting multi-parameters methods for linear complementarity problems
• The improved convergence of MSMMAOR method for linear complementarity problems
• The relaxation convergence of multisplitting AOR method for linear complementarity problem
• New convergence of modulus-based synchronous block multisplitting multi-parameter methods for linear complementarity problems
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
• On convergence of two-stage splitting methods for linear complementarity problems
• Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
• Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
• The nonsmooth Newton's method for the horizontal nonlinear complementarity problem
• A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems
• IGAOR and multisplitting IGAOR methods for linear complementarity problems
• Relaxed modulus-based synchronous multisplitting multi-parameters TOR (two-parameters over-relaxation) methods for linear complementarity problems
• A accelerated modified shift-splitting method for nonsymmetric saddle point problems
• Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum
• Two variants of robust two-step modulus-based matrix splitting iteration methods for mixed-cell-height circuit legalization problem
• On convergence of residual-based extended Kaczmarz method for solving inconsistent linear systems
• Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
• A modified damped Newton method for linear complementarity problems
• Multisplitting iteration schemes for solving a class of nonlinear complementarity problems

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: The convergence of parallel iteration algorithms for linear complementarity problems

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