Chaotic iterative methods for the linear complementarity problems

DOI10.1016/S0377-0427(98)00111-3zbMATH Open0927.65079OpenAlexW2031900145MaRDI QIDQ1298640FDOQ1298640

Authors: Zhong-Zhi Bai, D. J. Evans 

Publication date: 25 November 1999

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(98)00111-3

zbMATH Keywords

convergencelinear complementarity problemparallel computationmultisplittingchaotic iteration

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)

Cites Work

• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Matrix multisplitting relaxation methods for linear complementarity problems
• Convergence of relaxed parallel multisplitting methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Title not available (Why is that?)
• Convergence of parallel multisplitting iterative methods for M-matrices
• On the convergence of the parallel multisplitting AOR algorithm
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Models of parallel chaotic iteration methods

Cited In (24)

• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• The convergence of a modulus-based matrix splitting iteration method for solving the implicit complementarity problems
• Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem
• Generalized AOR methods for linear complementarity problem
• The modulus-based matrix double splitting iteration method for linear complementarity problems
• Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
• A modified damped Newton method for linear complementarity problems
• On convergence of two-stage splitting methods for linear complementarity problems
• A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of \(H_+\)-matrices
• Modified AOR methods for linear complementarity problem
• A class of new modulus-based matrix splitting methods for linear complementarity problem
• A multiplicative Schwarz iteration scheme for solving the linear complementarity problem with an \(H\)-matrix
• Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• IGAOR and multisplitting IGAOR methods for linear complementarity problems
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem
• Inexact multisplitting methods for linear complementarity problems
• Chaotic behavior of the affine scaling algorithm for linear programming
• Grid solution of problem with unilateral constraints
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
• The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems

This page was built for publication: Chaotic iterative methods for the linear complementarity problems

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