The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
From MaRDI portal
Publication:781116
DOI10.1155/2019/2976768zbMath1452.65106OpenAlexW2965587509MaRDI QIDQ781116
Heng-Jun Zhao, Xi-Ming Fang, Zhijun Qiao
Publication date: 16 July 2020
Published in: Advances in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/2976768
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- 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
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- A fixed point method for the linear complementarity problem arising from American option pricing
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- The principal pivoting method revisited
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- Extensions of Lemke's algorithm for the linear complementarity problem
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- Block pivot methods for solving the complementarity problem
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- The convergence of parallel iteration algorithms for linear complementarity problems
- A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices
- Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
- A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Principal Pivoting Method for Solving Column Sufficient Complementarity Problems
- Direct algorithm for the solution of two-sided obstacle problems with M -matrix
- On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
- A modified modulus method for symmetric positive-definite linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Direct algorithms to solve the two-sided obstacle problem for anM-matrix
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- Matrix multisplitting relaxation methods for linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- A generalized complementary pivoting algorithm
- The general modulus-based Jacobi iteration method for linear complementarity problems
- Equilibrium Points of Bimatrix Games
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- A non-modulus linear method for solving the linear complementarity problem
