A support submatrix for the generalized linear complementarity problem

DOI10.1016/0893-9659(94)90091-4zbMATH Open0810.65062OpenAlexW2061871633MaRDI QIDQ1343546FDOQ1343546

Authors: Aniekan A. Ebiefung 

Publication date: 2 March 1995

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(94)90091-4

Recommendations

• An Algorithm for the Linear Complementarity Problem with a $P_0 $-Matrix
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• scientific article
• A polynomial-time algorithm for a class of linear complementarity problems
• An enumerative method for the solution of linear complementarity problems

zbMATH Keywords

algorithmlinear complementarity problempolynomial timerepresentative submatrixsupport submatrices

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Vacuum and non‐vacuum solutions of the quasi‐hydrodynamic semiconductor model in thermal equilibrium
• The thermal equilibrium state of semiconductor devices

Cited In (4)

• A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
• Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem
• A result of Shepp
• Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem: Revisited

This page was built for publication: A support submatrix for the generalized linear complementarity problem

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