Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

DOI10.1016/J.CAM.2011.03.021zbMATH Open1220.65066OpenAlexW2119593219MaRDI QIDQ550095FDOQ550095

Authors: Mehdi Dehghan, Masoud Hajarian 

Publication date: 8 July 2011

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

Full work available at URL: https://doi.org/10.1016/j.cam.2011.03.021

Recommendations

• Matrix multisplitting relaxation methods for linear complementarity problems
• Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• A multiplicative multisplitting method for solving the linear complementarity problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

zbMATH Keywords

linear complementarity problem\(M\)-matrix\(H\)-matrixmonotone convergenceGAOR methodSSOR method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Title not available (Why is that?)
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Matrix multisplitting relaxation methods for linear complementarity problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complementary pivot theory of mathematical programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Title not available (Why is that?)
• On the solution of large, structured linear complementarity problems: the block partitioned case
• A multisplitting method for symmetric linear complementarity problems
• Inexact multisplitting methods for linear complementarity problems
• On convergence of two-stage splitting methods for linear complementarity problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Convergence of SSOR multisplitting method for an \(H\)-matrix
• A power penalty method for linear complementarity problems
• On the convergence of the generalized AOR method
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• The convergence of parallel iteration algorithms for linear complementarity problems
• Improving projected successive overrelaxation method for linear complementarity problems
• Generalized AOR methods for linear complementarity problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The linear complementarity problem as a separable bilinear program
• Preconditioned AOR iterative method for linear systems
• Relaxed asynchronous iterations for the linear complementarity problem
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Modified AOR methods for linear complementarity problem
• Conjugate gradient method for the linear complementarity problem withs-matrix
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• On the solution of large, structured linear complementarity problems: The tridiagonal case
• Chaotic iterative methods for the linear complementarity problems
• A rapid algorithm for a class of linear complementarity problems
• Integer solution for linear complementarity problem
• Title not available (Why is that?)
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
• A modified damped Newton method for linear complementarity problems

Cited In (12)

• Explicit synchronous partitioned algorithms for interface problems based on Lagrange multipliers
• Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
• A multiplicative multisplitting method for solving the linear complementarity problem
• Improved modulus-based matrix splitting iteration methods for a class of horizontal implicit complementarity problems
• Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices
• On generalizations of positive subdefinite matrices and the linear complementarity problem
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• Momentum acceleration-based matrix splitting method for solving generalized absolute value equation
• Modulus-based matrix splitting methods for complex linear complementarity problem
• Fast modulus-based matrix splitting iteration methods for implicit complementarity problems
• The iterative algorithm for solving a class of generalized coupled Sylvester-transpose equations over centrosymmetric or anti-centrosymmetric matrix
• Linearized methods for tensor complementarity problems

This page was built for publication: Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

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