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

DOI10.1007/S11075-016-0112-0zbMATH Open1353.65054OpenAlexW2294436269MaRDI QIDQ342867FDOQ342867

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

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

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)

Cites Work

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

Cited In (17)

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