The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
From MaRDI portal
Publication:2203800
DOI10.1016/j.camwa.2018.10.040zbMath1442.65112OpenAlexW2901673765WikidataQ128920362 ScholiaQ128920362MaRDI QIDQ2203800
Xiao-Bin Tang, Huan Ren, Xiang Wang, Teng Wang
Publication date: 2 October 2020
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2018.10.040
convergencelinear complementarity problemmodulus-based matrix splitting iteration methodtwo-sweep method
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear equations (linear algebraic aspects) (15A06) Numerical methods for variational inequalities and related problems (65K15)
Related Items (17)
An improvement on a class of fixed point iterative methods for solving absolute value equations ⋮ Iterative schemes induced by block splittings for solving absolute value equations ⋮ Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones ⋮ Accelerated double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems ⋮ The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems ⋮ The new iteration algorithm for absolute value equation ⋮ Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems ⋮ A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems ⋮ Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices ⋮ Absolute value equations with tensor product structure: unique solvability and numerical solution. ⋮ A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H+-matrices ⋮ Two-step modulus-based matrix splitting iteration method for horizontal linear 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
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
- On positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equation \(AX+XB=C\)
- Trigonometric collocation methods based on Lagrange basis polynomials for multi-frequency oscillatory second-order differential equations
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Convergence of relaxed parallel multisplitting methods
- Solution of symmetric linear complementarity problems by iterative methods
- Modified AOR methods for linear complementarity problem
- A block-centered finite difference method for an unsteady asymptotic coupled model in fractured media aquifer system
- On the convergence of additive and multiplicative splitting iterations for systems of linear equations
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- Existence and uniqueness of symmetric positive solutions of \(2n\)-order nonlinear singular boundary value problems
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- Efficient implementation of RKN-type Fourier collocation methods for second-order differential equations
- Exploring delayed Mittag-Leffler type matrix functions to study finite time stability of fractional delay differential equations
- Convergence and comparison theorems for double splittings of matrices
- Solution analysis for the pseudomonotone second-order cone linear complementarity problem
- Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- An Efficient Matrix Splitting Method for the Second-Order Cone Complementarity Problem
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems
- Matrix multisplitting relaxation methods for linear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- Modulus‐based multigrid methods for linear complementarity problems
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- A Modified HSS Iteration Method for Solving the Complex Linear Matrix Equation AXB = C
- The general modulus-based Jacobi iteration method for linear complementarity problems
- Preconditioned Positive-Definite and Skew-Hermitian Splitting Iteration Methods for Continuous Sylvester Equations AX + XB = C
- An efficient algorithm for second-order cone linear complementarity problems
- A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- On SSOR‐like preconditioners for non‐Hermitian positive definite matrices
- A preconditioned modulus-based iteration method for solving linear complementarity problems ofH-matrices
This page was built for publication: The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
