The reduced order method for solving the linear complementarity problem with an M-matrix

DOI10.1007/S44198-022-00029-WMaRDI QIDQ2172919zbMATH OpenOpenAlexFDO

Authors Xi-Ming Fang, J. Li, Zhijun Qiao, Hengjun Zhao

Publication date 19 September 2022

Published in Journal of Nonlinear Mathematical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s44198-022-00029-w

zbMATH Keywords

\(M\)-matrixdirect methodlinear complementarity problemsolution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1131989
• Solution of P₀ -Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
• scientific article; zbMATH DE number 2077071
• Gaussian pivoting method for solving linear complementarity problem
• A non-modulus linear method for solving the linear complementarity problem

Cites work

• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• A comparison of error bounds for linear complementarity problems of \(H\)-matrices
• A fixed point method for the linear complementarity problem arising from American option pricing
• A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• A modified damped Newton method for linear complementarity problems
• A modified modulus method for symmetric positive-definite linear complementarity problems.
• A non-modulus linear method for solving the linear complementarity problem
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Chaotic iterative methods for the linear complementarity problems
• Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
• Computation of error bounds for P-matrix linear complementarity problems
• Direct algorithm for the solution of two-sided obstacle problems with M-matrix.
• Direct algorithms to solve the two-sided obstacle problem for anM-matrix
• Engineering and Economic Applications of Complementarity Problems
• Error bounds for the linear complementarity problem with a P-matrix
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 1131989 (Why is no real title available?)
• scientific article; zbMATH DE number 4197293 (Why is no real title available?)
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• On the solution of large, structured linear complementarity problems: The tridiagonal case
• Perturbation Bounds of P-Matrix Linear Complementarity Problems
• The principal pivoting method revisited
• The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
• Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems

This page was built for publication: The reduced order method for solving the linear complementarity problem with an \(M\)-matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172919)