A new principal pivoting scheme for box linear complementarity problems

MaRDI QIDQ1355898zbMATH OpenFDO

Authors Zhemin Wang

Publication date 5 October 1997

Published in Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

zbMATH Keywords

box linear complementarity problemsprincipal pivotingrow sufficient

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Principal pivoting method for solving column sufficient complementarity problems
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
• Basic-set algorithm for a generalized linear complementarity problem
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cited in

(1)

• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix

This page was built for publication: A new principal pivoting scheme for box linear complementarity problems

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