scientific article; zbMATH DE number 4197293

MaRDI QIDQ5203589zbMATH OpenFDO

Authors Shuzi Zhou

Publication date 1990

zbMATH Keywords

linear complementarity problemsdirect methodpolynomial time algorithmStieltjes matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1131989
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• Gaussian pivoting method for solving linear complementarity problem
• A new polynomial time method for a linear complementarity problem
• Iterative algorithms for the linear complementarity problem

Cited in

(9)

• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
• Gaussian pivoting method for solving linear complementarity problem
• Conjugate gradient method for the linear complementarity problem withs-matrix
• An iterative method for the discrete problems of a class of elliptical variational inequalities
• Two direct methods in linear programming
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• scientific article; zbMATH DE number 1131989 (Why is no real title available?)
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

This page was built for publication:

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