A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems
From MaRDI portal
Publication:2111550
DOI10.1007/s13160-022-00514-1OpenAlexW4281560907MaRDI QIDQ2111550
Publication date: 17 January 2023
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-022-00514-1
convergencemodulus-based matrix splitting iteration methodhorizontal linear complementarity problemsrelaxation two-sweep technique
Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- Splitting methods for a class of horizontal linear complementarity problems
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems
- A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
- On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
- Modulus-based matrix splitting methods for horizontal linear complementarity problems
- A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices
- A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- A modified modulus method for symmetric positive-definite linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Modified modulus‐based matrix splitting iteration methods for linear complementarity problems
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- The Extended Linear Complementarity Problem
- A Relaxation Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers
- A preconditioned modulus-based iteration method for solving linear complementarity problems ofH-matrices
