The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems
From MaRDI portal
Publication:2140763
DOI10.1007/S40314-022-01842-1zbMath1499.65215OpenAlexW4225637133MaRDI QIDQ2140763
Publication date: 23 May 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-022-01842-1
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Reducing a monotone horizontal LCP to an LCP
- 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
- Reducing horizontal linear complementarity problems
- On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication
- A modulus-based nonsmooth Newton's method for solving horizontal 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 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
- 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
- Engineering and Economic Applications of Complementarity Problems
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- Two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Complementarity problems
- A smoothing Gauss-Newton method for the generalized HLCP
This page was built for publication: The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems