The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
type: Item
instance of: scholarly article
title: The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
zbMATH Open document ID: 1452.65106
DOI: 10.1155/2019/2976768
author: Xi-Ming Fang
author: Zhijun Qiao
author: Hengjun Zhao
published in: Advances in Mathematical Physics
publication date: 2020-07-16T00:00:00Z
review text: Summary: The principal pivoting algorithm is a popular direct algorithm in solving the linear complementarity problem, and its block forms had also been studied by many authors. In this paper, relying on the characteristic of block principal pivotal transformations, a block principal pivoting algorithm is proposed for solving the linear complementarity problem with an \(M\)-matrix. By this algorithm, the linear complementarity problem can be solved in some block principal pivotal transformations. Besides, both the lower-order and the higher-order experiments are presented to show the effectiveness of this algorithm.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 7221702
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2019/2976768
OpenAlex ID: W2965587509
cites work: Modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: Q4003375
cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case
cites work: Q4337614
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Equilibrium Points of Bimatrix Games
cites work: Q4039868
cites work: A fixed point method for the linear complementarity problem arising from American option pricing
cites work: Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: A non-modulus linear method for solving the linear complementarity problem
cites work: A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
cites work: Direct algorithm for the solution of two-sided obstacle problems with \(M\)-matrix.
cites work: Q5203589
cites work: Q4382888
cites work: Direct algorithms to solve the two-sided obstacle problem for anM-matrix
cites work: Two-step modulus-based matrix splitting iteration method for linear complementarity problems
cites work: The principal pivoting method revisited
cites work: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
cites work: Block pivot methods for solving the complementarity problem
cites work: A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
cites work: Principal pivoting method for solving column sufficient complementarity problems
cites work: A generalized complementary pivoting algorithm
cites work: Extensions of Lemke's algorithm for the linear complementarity problem
cites work: A modified modulus method for symmetric positive-definite linear complementarity problems
cites work: The general modulus-based Jacobi iteration method for linear complementarity problems
cites work: A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
cites work: A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
cites work: On the number of solutions to the complementarity problem and spanning properties of complementary cones
cites work: The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
cites work: A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices
cites work: Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
cites work: Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
cites work: Iterative methods for linear complementarity problems with upperbounds on primary variables
cites work: The convergence of parallel iteration algorithms for linear complementarity problems
cites work: Matrix multisplitting relaxation methods for linear complementarity problems
cites work: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
cites work: Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
cites work: On iterative solution for linear complementarity problem with an \(H_{+}\)-matrix
cites work: Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
Recommended article: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
Recommended article: A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
Recommended article: An Algorithm for the Linear Complementarity Problem with a $P_0 $-Matrix
Recommended article: On the convergence of the block principal pivotal algorithm for the LCP
Recommended article: Algorithms for the Generalized Linear Complementarity Problem with a Vertical BlockZ-Matrix
Recommended article: An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix
Recommended article: A new principal pivoting scheme for box linear complementarity problems
Recommended article: Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
Recommended article: A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
Recommended article: AN IMPROVED BLOCK MODULUS METHOD FOR DIAGONALLY DOMINANT LINEAR COMPLEMENTARITY PROBLEMS
description: scientific article; zbMATH DE number 7221702