The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method

DOI10.1007/s11075-016-0112-0zbMath1353.65054OpenAlexW2294436269MaRDI QIDQ342867

Apostolos Hadjidimos, Michael Tzoumas

Publication date: 18 November 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0112-0

zbMATH Keywords

numerical exampleslinear complementarity problemregular splittingsPerron-Frobenius theory\(H_{+}\)-matricesaccelerated overrelaxation iterative methodconvergence intervalsGauss-Seidel iterative method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10)

Related Items (9)

On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix ⋮ The reduced order method for solving the linear complementarity problem with an \(M\)-matrix ⋮ The accelerated overrelaxation splitting method for solving symmetric tensor equations ⋮ Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix ⋮ PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX ⋮ Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems ⋮ Error bounds for linear complementarity problems of \(S\)-QN matrices ⋮ A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems ⋮ A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• Is \(A\in\mathbb C^{n,n}\) a general \(H\)-matrix?
• Comparison theorems for weak splittings of bounded operators
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Factorization iterative methods, M-operators and H-operators
• Solution of symmetric linear complementarity problems by iterative methods
• The convergence of parallel iteration algorithms for linear complementarity problems
• On the convergence of the generalized AOR method
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• Improving projected successive overrelaxation method for linear complementarity problems
• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
• Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
• Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
• Theorems on M-splittings of a singular M-Matrix which depend on graph structure
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
• New convergence proofs of modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• The matrix analogue of the scalar AOR iterative method
• Generalized AOR methods for linear complementarity problem
• Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix
• On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Iterative algorithms for the linear complementarity problem
• An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Iterative Solution of Nonlinear Equations in Several Variables
• A New Iterative Criterion for H‐Matrices
• A note on the convergence of the MSMAOR method for linear complementarity problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method