The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

DOI10.1007/S40314-014-0114-2MaRDI QIDQ2342902zbMATH OpenOpenAlexFDO

Authors Masoud Hajarian

Publication date 29 April 2015

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

Full work available at URL https://doi.org/10.1007/s40314-014-0114-2

zbMATH Keywords

linear complementarity problem\(M\)-matrix\(H\)-matrixconvergence property\(L\)-matrixmatrix multisplittingchaotic iteration

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Recommendations

• A class of generalized multisplitting relaxation methods for linear complementarity problems
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
• Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
• Matrix multisplitting relaxation methods for linear complementarity problems
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• 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 2051935 (Why is no real title available?)
• scientific article; zbMATH DE number 1766748 (Why is no real title available?)
• scientific article; zbMATH DE number 1874107 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• A modified damped Newton method for linear complementarity problems
• A multisplitting method for symmetric linear complementarity problems
• A power penalty method for linear complementarity problems
• A proximal gradient descent method for the extended second-order cone linear complementarity problem
• A weighted-path-following method for the linear complementarity problem
• Asynchronous multisplitting relaxation methods for linear complementarity problems
• Chaotic iterative methods for the linear complementarity problems
• Conjugate gradient method for the linear complementarity problem withs-matrix
• Convergence of SSOR methods for linear complementarity problems
• Engineering and Economic Applications of Complementarity Problems
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems.
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• On convergence of two-stage splitting methods for linear complementarity problems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• Relaxed asynchronous iterations for the linear complementarity problem
• The convergence of parallel iteration algorithms for linear complementarity problems
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

Cited in

(7)

• Convergence of SSOR methods for linear complementarity problems
• IGAOR and multisplitting IGAOR methods for linear complementarity problems
• Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods
• A note on the MSMAOR method for linear complementarity problems
• Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
• Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
• On generalizations of positive subdefinite matrices and the linear complementarity problem

This page was built for publication: The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

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