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

DOI10.1007/S11075-016-0112-0MaRDI QIDQ342867zbMATH OpenOpenAlexFDO

Authors A. Hadjidimos, M. 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 problemPerron-Frobenius theory\(H_{+}\)-matricesaccelerated overrelaxation iterative methodconvergence intervalsGauss-Seidel iterative methodregular splittings

Mathematics Subject Classification ID

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

Recommendations

• On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
• Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• Two generalized accelerated over relaxation algorithms for solving linear complementarity problems
• A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
• Accelerated double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems
• A note on the implementation of the successive overrelaxation method for linear complementarity problems
• On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
• On iterative solution for linear complementarity problem with an \(H_{+}\)-matrix
• Accelerate overrelaxation methods for rank deficient linear systems

Cites work

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

Cited in

(17)

• Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
• A note on the implementation of the successive overrelaxation method for linear complementarity problems
• On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
• Two generalized accelerated over relaxation algorithms for solving linear complementarity problems
• Improving projected successive overrelaxation method for linear complementarity problems
• Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
• On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix
• Accelerate overrelaxation methods for rank deficient linear systems
• Adaptive projected SOR algorithms for nonnegative quadratic programming
• Delayed over-relaxation in iterative schemes to solve rank deficient linear system of (matrix) equations
• An interval GAOR method for linear complementarity problems
• Error bounds for linear complementarity problems of \(S\)-QN matrices
• A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• The accelerated overrelaxation splitting method for solving symmetric tensor equations
• Preconditioned SSOR methods for the linear complementarity problem with \(M\)-matrix
• A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems

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

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